DSA Studio

DP Fundamentals

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 robber cannot choose adjacent houses. For values [4,1,1,5], what is the maximum total?
2. Unlimited coins [3,5] must total 7. What should minimum-coin DP return?

Select one answer.

3. How many ways climb 5 stairs using steps of size 1 or 2?
4. A strictly increasing subsequence routine processes [2,2,3]. What is its length?

Select one answer.

5. A memo key for coin-change recursion contains only the remaining amount while the recursion also restricts the allowed coin prefix. What is wrong?

Select one answer.

Join Discord