Algorithm · Microsoft · Hard
Problem You are given an m x n integer matrix grid. Starting at the top-left cell (0, 0), you must reach the bottom-right cell (m - 1, n - 1). A move consists of stepping to an adjacent cell in one of four directions: up, down, left, or right. The score of a path is the smallest integer value among all cells visited on that path. Return the maximum possible score over all valid paths from the start cell to the end cell. Constraints 1 (0,1) -> (0,2) -> (1,2) -> (2,2) visits…
Checking your access…