Minimax-path

2 articles

dsa8 min read

Path With Minimum Maximum Weight — Binary Search the Answer + BFS [Bottleneck Shortest Path, Google, Amazon]

Solve the bottleneck shortest path problem: find a route from source to destination that minimises the maximum edge weight on the path. Combines binary search on the answer with BFS connectivity checks in O((V+E) log W) — a FAANG interview pattern asked at Google and Amazon, and the foundation behind LeetCode 1102 Path With Maximum Minimum Value.

March 19, 2026Read →

dsa8 min read

Swim in Rising Water — Dijkstra and Binary Search + BFS on a Grid [LC 778, Google, Amazon, Meta]

Master LeetCode 778 Swim in Rising Water by reducing a grid puzzle to a minimax shortest-path problem. Solve it three ways — Dijkstra with max-relax, binary search plus BFS, and Kruskal-style union-find — and learn when each approach wins. A FAANG hard interview classic at Google, Amazon, and Meta.

March 19, 2026Read →