dsa1 min read
Path with Minimum Maximum Weight — Binary Search + BFS
Find the path from source to destination minimising the maximum edge weight. Binary search on the answer + BFS/DFS connectivity check. O(E log W) total.
Read →
All Posts
1575 articles
dsa2 min read
Number of Ways to Arrive at Destination — Dijkstra + Count
Count the number of shortest paths from source to destination using modified Dijkstra that tracks both minimum distance and path count simultaneously.
Read →
dsa2 min read
Find Critical Connections in Network — Bridge Finding
LeetCode 1192: Find all critical edges (bridges) in a network. A connection is critical if removing it disconnects the network. Uses Tarjan's bridge algorithm.
Read →
dsa2 min read
Reconstruct Itinerary — Hierholzer's Eulerian Path
Find the itinerary using all flight tickets exactly once (Eulerian path). Uses Hierholzer's algorithm: DFS with post-order insertion into result — the only graph algorithm that uses post-order for path construction.
Read →
dsa2 min read
Swim in Rising Water — Dijkstra / Binary Search + BFS
Find the minimum time to swim from (0,0) to (n-1,n-1) where you can only move to a cell when time >= cell value. Two approaches: Dijkstra O(n² log n) and binary search + BFS O(n² log n).
Read →
Page 289 of 315