Interview classic: Swim in Rising Water.
Binary search + DFS/BFS, or Dijkstra on grid max-edge.
Time/space depend on constraints; aim for the optimal DP/graph solution above.
Walk through a small example out loud, state invariants, then code.
Practice with try it free.