Multiple ChoiceHard 180s
[Algorithms] Knapsack Subproblem memoization
0/1: dp[w] = max(dp[w], dp[w-wt]+val).
Options
- 1Dynamic programming
- 2Binary search
- 3Quicksort
- 4BFS
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.