Skip to main content

Algorithms

Exam prep

Print a unit's problems with full solutions, or sit a practice final that covers the whole course.

Study packets

  1. Unit 1 · 51 problems Free with an account

    Correctness proofs and asymptotic complexity

  2. Unit 2 · 54 problems

    Divide-and-conquer algorithms

  3. Unit 3 · 52 problems

    Greedy algorithms and exchange proofs

  4. Unit 4 · 53 problems

    Dynamic programming and state design

  5. Unit 5 · 53 problems

    Graph optimization and traversal algorithms

  6. Unit 6 · 52 problems

    Reductions, NP-completeness, and approximation

Packets and practice finals are for your own study. They do not count as Training attempts.