dsa2 min read
Graph Coloring and Hamiltonian Path: Backtracking on Graphs
Color a graph with m colors (no adjacent same color) and find Hamiltonian paths using backtracking with neighbor constraint checking.
Read →
All Posts
1276 articles
dsa3 min read
Remove Invalid Parentheses and Expression Parsing
Remove minimum invalid parentheses to produce all valid results. BFS approach for minimum removals, DFS for complete enumeration.
Read →
dsa3 min read
Beautiful Arrangement and Constraint Satisfaction
Solve Beautiful Arrangement and similar constraint-based permutation problems with backtracking and precomputed valid positions.
Read →
dsa3 min read
Subset Sum and Partition DP: Backtracking vs DP
Compare backtracking and DP approaches for subset sum: when to use each, conversion to knapsack, and bitset optimization.
Read →
dsa2 min read
Tiling and Splitting Problems: Backtracking meets DP
Solve tiling (domino, triomino) and optimal string splitting problems combining backtracking insight with DP optimization.
Read →
Page 219 of 256