Given a 2D grid of integers, find a path from the top-left cell (0,0) to the bottom-right cell (m-1, n-1) that maximizes the minimum value along the path, excluding the starting and ending cells.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.