🏆 Ages 13 and up · advanced · 16 sessions
Competitive programming and algorithms: course outline
The algorithms behind coding olympiads such as USACO and the IOI: complexity, searching, sorting, recursion, graphs and dynamic programming.
Syllabus
Every session in order
The full outline is ready; lessons are written in this order, each as a complete 60-minute class.
Unit 1 · Foundations
- 1Reading a problem and its limitscoming
- 2Big O: how fast is it?coming
- 3Brute force and simulationcoming
- 4Prefix sumscoming
Unit 2 · Searching and sorting
- 5Binary searchcoming
- 6Sorting and custom orderscoming
- 7Two pointerscoming
- 8Greedy choicescoming
Unit 3 · Recursion and graphs
- 9Recursion and backtrackingcoming
- 10Graphs and BFScoming
- 11DFS and connected partscoming
- 12Shortest pathscoming
Unit 4 · Dynamic programming
- 13What DP iscoming
- 14Knapsackcoming
- 15Grids and pathscoming
- 16Contest practicecoming
Class timetable
Plan the dates
Pick the first class date and the days you teach. Every session gets a date, saved on this device; download it to add every class to your calendar.
FAQ
Competitive programming and algorithms: questions
Who is the Algorithms course for?
Ages 13 and up · advanced. It starts from the beginning and each session builds on the one before.
How long is each session?
About 60 minutes, with a minute-by-minute plan at the bottom of every lesson.
What does a learner need?
A computer or tablet with a browser. Nothing to install: code runs on the page, puzzles are interactive, and every lesson has a printable practice sheet.
Can I plan a timetable?
Yes. Choose a start date and the class days below. It lists the date of every session and can be added to your calendar.
Start a conversation
Want a teacher for algorithms?
Tell us the learner's age and level. We match a teacher from our network and confirm the timing and price first.
- Tell us the learner’s age or grade and goals
- We’ll suggest a suitable class or learning path
- We’ll confirm format, timing and fees with a parent or guardian