Contest Python: USACO Bronze

Algorithms for your first programming contests

Contents

14 units, 4 checkpoints, 1 project, in the order the course teaches them.

  1. Unit 1: Reading the InputExercises (9): Unit 1 — Reading the InputSlides: Unit 1 — Reading the Input
  2. Unit 2: Boolean Logic & AlgebraExercises (9): Unit 2 — Boolean Logic & AlgebraSlides: Unit 2 — Boolean Logic & Algebra
  3. Unit 3: Fast Enough?Exercises (9): Unit 3 — Fast Enough?Slides: Unit 3 — Fast Enough?
  4. Unit 4: Sets, Tuples & SortingExercises (9): Unit 4 — Sets, Tuples & SortingSlides: Unit 4 — Sets, Tuples & Sorting
  5. Unit 5: Searching & Complete SearchExercises (9): Unit 5 — Searching & Complete SearchSlides: Unit 5 — Searching & Complete Search
  6. Checkpoint 1: Mock Contest 1Questions (6): Checkpoint 1 — Mock Contest 1
  7. Unit 6: GreedyExercises (9): Unit 6 — GreedySlides: Unit 6 — Greedy
  8. Unit 7: Simulation & Ad HocExercises (9): Unit 7 — Simulation & Ad HocSlides: Unit 7 — Simulation & Ad Hoc
  9. Unit 8: Prefix SumsExercises (9): Unit 8 — Prefix SumsSlides: Unit 8 — Prefix Sums
  10. Checkpoint 2: Mock Contest 2Questions (6): Checkpoint 2 — Mock Contest 2
  11. Unit 9: Recursion & BacktrackingExercises (9): Unit 9 — Recursion & BacktrackingSlides: Unit 9 — Recursion & Backtracking
  12. Unit 10: Stacks, Queues & DequesExercises (9): Unit 10 — Stacks, Queues & DequesSlides: Unit 10 — Stacks, Queues & Deques
  13. Unit 11: Number Systems, Bitwise & Number TheoryExercises (10): Unit 11 — Number Systems, Bitwise & Number TheorySlides: Unit 11 — Number Systems, Bitwise & Number Theory
  14. Unit 12: Binary Trees & TraversalsExercises (9): Unit 12 — Binary Trees & TraversalsSlides: Unit 12 — Binary Trees & Traversals
  15. Checkpoint 3: Mock Contest 3Questions (7): Checkpoint 3 — Mock Contest 3
  16. Unit 13: Grids, Graphs & TraversalExercises (9): Unit 13 — Grids, Graphs & TraversalSlides: Unit 13 — Grids, Graphs & Traversal
  17. Unit 14: Two Pointers & Sliding WindowExercises (9): Unit 14 — Two Pointers & Sliding WindowSlides: Unit 14 — Two Pointers & Sliding Window
  18. Checkpoint 4: Mock Contest 4Questions (7): Checkpoint 4 — Mock Contest 4
  19. Project 3: Grand Mock Contest — Contest Python: USACO Bronze CapstoneProblems (8): Grand Mock Contest — Contest Python: USACO Bronze Capstone

Printable books (PDF)

Release pdfs-2026-09-30. The links open the files on GitHub.

For parents and teachers:

Use this book offline

Downloading a book needs JavaScript.

Everything stays on this device. Some browsers, Safari in particular, can clear a site's storage after weeks without a visit: keep a copy of your work with “Export my progress” on the home page.

Concept mastery

The share of each concept's quiz cards you know well (answered right twice, at least a day apart). Practise with the quiz cards.

All 21 concepts

Data structures

  • Set literals0%
  • Set operations (add/discard, union/intersection)0%
  • Tuples0%
  • Double-ended queue (deque)0%
  • 2D grids (list of lists)0%

IO

  • Splitting strings0%
  • Parsing structured input0%

Sorting

  • Sorting with a key0%

Techniques

  • Recursion (self-calling functions)0%
  • Time complexity / Big-O0%
  • Boolean algebra0%
  • Reading and tracing code0%
  • Greedy algorithms0%
  • Simulation / ad hoc0%
  • Prefix sums0%
  • Two pointers / sliding window0%

Number theory

  • Bitwise operators0%
  • Number base conversion0%
  • Sieve of Eratosthenes / primes0%

Search

  • Complete search (brute force)0%
  • Binary search0%