DSA Studio

Advanced DP Checkpoint

Work fresh traces, diagnose invalid implementations, and identify model boundaries.

Get every question correct to pass this checkpoint. You can review feedback, revise your answers, and submit again.

1. A 0/1 knapsack has one item of weight 2, value 3 and capacity 4. What is the optimum value?
2. Why does one-dimensional 0/1 knapsack scan capacities downward for each item?

Select one answer.

3. In tree robber DP, a parent is taken. What child state may contribute?

Select one answer.

4. How many longest strictly increasing subsequences are in [1,3,2,4]?
5. For interval burst-balloons DP, why choose the last balloon burst inside an interval?

Select one answer.

Join Discord