Internship← All free certificatesFree learning path Final step
Competitive Programming
10 short modules. Each one: a simple lesson, two quick games and a 8-question quiz for its own free certificate. Finish them all, then take the full Competitive Programming certificate.
0 of 10 module certificates
- What competitive programming isSolve well-defined problems fast and correctly under time and memory limits.0/4
- Time complexity and constraintsPick an algorithm whose complexity fits the input size.0/4
- Fast input/output and templatesRead big inputs fast and keep a clean starting template.0/4
- Sorting, searching and two pointersClassic tools that turn O(n^2) ideas into O(n log n) or O(n).0/4
- Prefix sums and hashingAnswer range queries and lookups in constant time.0/4
- Greedy algorithmsMake the best local choice when it is provably safe.0/4
- Recursion and backtrackingExplore choices step by step and undo them.0/4
- Dynamic programmingStore answers to overlapping subproblems.0/4
- Graphs: BFS, DFS and shortest pathsModel connections and travel them efficiently.0/4
- Number theory and contest strategyMath tools and habits that win contests.0/4
🏆 Full Competitive Programming certificate
20 questions from basic to advanced, 60% to pass. Best taken after the modules.