Knapsack

1 problem using this pattern

About this pattern:

A useful algorithmic pattern for solving coding problems efficiently.

Often used with: Dynamic Programming

Complexity Range

Time Complexity

O(amount × coins) (1 problem)

Space Complexity

O(amount) (1 problem)

Problems Using Knapsack

Coin Change

Find minimum number of coins needed to make the amount.

Medium LeetCode
Time: O(amount × coins)
Space: O(amount)
Example: coins=[1,3,4], amount=6 → 2 (3+3)
Dynamic Programming Knapsack
View Solution →
← Back to All Patterns
View All Categories