0/1 Knapsack

Category: Dynamic Programming

Difficulty: intermediate

Description: Maximize value with weight constraint

Time Complexity: O(nW)

Space Complexity: O(nW)

Related LeetCode Problems

• 70. Climbing Stairs (Easy)
• 198. House Robber (Easy)
• 416. Partition Equal Subset Sum (Medium)
• 494. Target Sum (Medium)
• 474. Ones and Zeroes (Medium)
• 279. Perfect Squares (Medium)
• 1049. Last Stone Weight II (Medium)
• 879. Profitable Schemes (Hard)
• 231. Power of Two (helper DP practice) (Easy)
• 322. Coin Change (Medium)
• 518. Coin Change 2 (Medium)
• 377. Combination Sum IV (Medium)
• 1048. Longest String Chain (Hard)