dsa2 min read
Partition Problems: Equal Subset Sum and K Equal Parts
Solve partition backtracking problems: equal sum subset (NP-hard, backtrack with pruning) and k equal sum subsets.
Read →
1575 articles
Solve partition backtracking problems: equal sum subset (NP-hard, backtrack with pruning) and k equal sum subsets.
Generate valid IP addresses from digit strings and all sentence segmentations with word break backtracking.
Generate all expressions by inserting +, -, * between digits to reach target. Track running value and last operand for multiplication.
Partition a string into all-palindrome substrings using backtracking with O(n^2) precomputed palindrome DP table for O(1) checks.
Generate all letter combinations from phone number digits using backtracking. Classic tree exploration with fixed branching factor.