← OYO questions

Row with max 1s, mutex vs semaphore, virtual memory, and rotten oranges

Filed under OYO

Find the row with the maximum number of 1s in a row-sorted binary matrix. Also, solve the 'Rotten Oranges' problem: given a grid where 2 is rotten, 1 is fresh, and 0 is empty, find the minimum time to…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.