dsa6 min read
Tiling and Interval Partitioning: Recursion to DP
Tiling problems and interval partitioning (Burst Balloons LC 312, Min Cost to Cut a Stick LC 1547) where recursion turns into beautiful interval DP.
Read →
All Posts
1582 articles
dsa6 min read
Subset Sum: Backtracking vs DP — When to Pick Each
Subset sum mastery: backtracking for enumeration, 0/1 knapsack DP for existence and counts, bitset tricks for huge targets, and FAANG interview tips.
Read →
dsa6 min read
Beautiful Arrangement: Constraint-Filtered Permutation Backtracking
LeetCode 526 Beautiful Arrangement with backtracking and bitmask DP. Learn how to generate divisibility-constrained permutations with FAANG interview tips.
Read →
dsa6 min read
Remove Invalid Parentheses: BFS vs DFS Backtracking
LeetCode 301 Remove Invalid Parentheses with BFS for minimum removals and DFS backtracking with precomputed quotas. FAANG hard-tier interview prep.
Read →
dsa6 min read
Graph Coloring and Hamiltonian Path: Backtracking on Graphs
M-coloring, bipartite check, and Hamiltonian path/cycle: backtracking on graphs with constraint propagation, ordering heuristics, and FAANG interview prep.
Read →
Page 137 of 317