Skip to main content

Prerequisite chain

Prerequisites for Dynamic Programming

Topics you need before working through Dynamic Programming. Direct prerequisites are listed first; transitive prerequisites (the chain reachable through them) follow.

Direct prerequisites (3)

  1. Sets, Functions, and Relationslayer 0A, tier 1
  2. Graph Algorithms Essentialslayer 0A, tier 2
  3. Greedy Algorithmslayer 0A, tier 2

Reachable through the chain (1)

These topics are not directly cited as prerequisites but are reached transitively by following the chain upward. Working through the direct prerequisites pulls these in.