Deck · IOI — Competitive Programming

Dynamic Programming

DP fundamentals, classic problems (knapsack, LIS, LCS, edit distance, MCM), grid/interval/tree/bitmask/digit DP, probability and counting DP, and standard optimizations.

81 cards · audited · SM-2 spaced repetition

or go All-Access →

Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.

Sample cards

1

Optimal substructure

2

Overlapping subproblems

3

Memoization vs tabulation

4

State definition

5

Transition and base cases

Showing 5 of 81 cards. Unlock the program to study them all.

More in IOI — Competitive Programming

Advanced Computational Geometry49 cardsAdvanced Graph Algorithms, Flows & Matching63 cardsGeneral Algorithmic Techniques & Analysis79 cardsCombinatorics & Counting66 cardsFundamental Data Structures78 cardsCombinatorial Game Theory49 cards

Master dynamic programming — and the rest of IOI — Competitive Programming.

One program. 964 audited cards across 14 decks.

or go All-Access →

See the full program →