dsa1 min read
Keys and Rooms — DFS/BFS Graph Reachability
Determine if all rooms are reachable. Start from room 0, DFS using keys found in each room to unlock new rooms.
Read →
All Posts
1276 articles
dsa1 min read
Find if Path Exists in Graph — BFS/Union-Find
Check if a path exists between source and destination in an undirected graph. BFS from source or Union-Find both work in O(V+E).
Read →
dsa1 min read
Nearest Exit from Entrance in Maze — BFS
BFS from entrance in a maze to find nearest exit (border empty cell). Classic BFS shortest path with exit condition.
Read →
dsa1 min read
Snakes and Ladders — BFS on Board State
Minimum dice rolls to reach square n^2. Convert board position to 2D coordinates (Boustrophedon order), BFS on board states.
Read →
dsa1 min read
Open the Lock — BFS State Space
Minimum turns to reach target combination avoiding deadends. BFS over all 4-digit wheel states with bidirectional BFS optimization.
Read →
Page 48 of 256