One-dimensional Dynamic Programming
135 / 170One-dimensional Dynamic ProgrammingLesson 11 of 11About 59 min
Two problems rebuilt cold, plus the three questions that produce a dynamic programming solution.
Reconsider the take-or-skip problem you solved earlier in this unit, choosing values with no two adjacent. Which state definition leads to a correct recurrence?
You have solved this one before. Rebuild it from scratch without looking at your old submission. If the approach does not come back within a few minutes, that is the signal that it needs another pass.
You have solved this one before. Rebuild it from scratch without looking at your old submission. If the approach does not come back within a few minutes, that is the signal that it needs another pass.