Data structures, algorithms and coding interviews
Competitive Programming
The planned outline of 14 modules. Lessons are written, run and reviewed before they are published.
Before this track
Planned outline
- Module 1
Contests, judges and the contest toolchain
Coming soon - Module 2
C++ for contests: containers, templates and speed
Coming soon - Module 3
Problem-solving techniques
Coming soon - Module 4
Number theory and algebra
Coming soon - Module 5
Counting, probability and games
Coming soon - Module 6
Range-query data structures
Coming soon - Module 7
Dynamic programming techniques
Coming soon - Module 8
Tree techniques
Coming soon - Module 9
Graph techniques
Coming soon - Module 10
Strings
Coming soon - Module 11
Computational geometry
Coming soon - Module 12
Interactive, IOI-style, randomised and heuristic problems
Coming soon - Module 13
Contest strategy, practice and rules
Coming soon - Module 14
Pathways in India and writing problems
India-specific Coming soon
Official documentation
- en.cppreference.com/w/cpp/algorithm (en.cppreference.com)
- icpc.global (icpc.global)
- docs.python.org/3/library/bisect.html (docs.python.org)
More in Data structures, algorithms and coding interviews
- Data Structures & Algorithms (coming soon)
- Coding Interview Patterns (coming soon)
- All DSA tracks
- How we make lessons