Skip to main content

2 docs tagged with "classic-problems"

View all tags

Classic Backtracking Problems

Master fundamental backtracking problems including N-Queens, Sudoku solver, permutations, combinations, and subsets with complete implementations.

Classic DP Problems

Master fundamental dynamic programming problems including 0/1 Knapsack, Longest Common Subsequence, Longest Increasing Subsequence, Coin Change, and Edit Distance.