(5) Binary Search: Swim in Rising Water

Question Link and Solution Link Difficulty: Hard Prerequisite: DFS on Grid Problem Statement: Given a grid of size n*n and we need to find a path from (0, 0) to (n-1, n-1) such that we need to minimize the value of the cell. Observation: We can ge...