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 →
State-space
3 articles
dsa1 min read
Minimum Jumps to Reach Home — BFS with State
BFS with (position, last_jumped_back) state to find min jumps home avoiding forbidden positions. State space BFS avoids revisiting same position+direction.
Read →
dsa2 min read
Dijkstra Advanced — Modified Dijkstra Patterns (K Stops, States, Constraints)
Advanced Dijkstra patterns: state-space Dijkstra for problems with extra constraints like K stops, fuel limit, or restricted nodes. The key is augmenting the state beyond just the node.
Read →