Skip to content
Sign in
← Learn

Foundations

Algorithm Foundations

Practice search, data structures, graph representations, and reusable subproblems.

Read first lesson
  1. 01

    Direct reasoning

    Translate a rule into a bounded search and justify its cost.

    Practice · 5

  2. 02

    Queues

    Represent first-in, first-out work and track queue size.

    Practice · 5

  3. 03

    Stacks

    Use last-in, first-out order for simulation and expressions.

    Practice · 5

  4. 04

    Graphs and trees

    Store connections and distinguish traversal from path search.

    Practice · 5

  5. 05

    Dynamic programming

    Define subproblems and reuse their answers.

    Practice · 4

  6. 06

    Divide and conquer

    Split a problem, solve smaller parts, and combine results.

    Practice · 2