Lecture 05: Dynamic Programming Choices

Content locked

The catalog is public. Reading this content requires approved access.

The recurring design question

Longest decreasing contiguous subsequence (LDCS)

Coin game: optimal play by an opponent

Questions from the recording

Making change with an unlimited coin supply

Why greedy change-making can fail

0/1 knapsack

The table does not greedily fill the bag

Fractional knapsack: the recording answers the slide exercise

Exam guidance from this recording

Connections