Problems/0/1 Knapsack (DP)

0/1 Knapsack (DP)

Make optimal choices with limited capacity. Foundational DP pattern for subset sum, coin change, and resource allocation.

16Total

1Climbing Stairs

4Coin Change II

5Partition Equal Subset Sum

8Combination Sum IV

9Minimum Path Sum

4Longest Common Subsequence

5Longest Increasing Subsequence

6Ones and Zeroes

7Perfect Squares