3Ps | Practice

Practicing for 0/1 Knapsack Problem of Algorithms

Questions 1 of 10

Q. The Knapsack problem is an example of ____________
- Greedy algorithm
- 2D dynamic programming
- 1D dynamic programming
- Divide and conquer