Google·Software Engineer·Technical Phone Screen
- Given a 2D grid of integers, find a path from the top-left cell to the bottom-right cell (moving in four directions) that minimizes the maximum cell value encountered along the way. Return that minimum possible maximum value.
“I knew BFS was involved but my first instinct was to binary search on the answer and check reachability at each candidate value.”