Curriculum
All Topics
10 topics covering core competitive programming concepts — from fundamentals to advanced algorithms. Each topic includes sessions, materials, and Codeforces practice sheets.
Arrays
Fundamentals of 1D and 2D arrays, traversal, prefix sums, and array tricks.
Basic Math & Number Theory
Primes, GCD, modular arithmetic, and number-theoretic algorithms.
Binary Search
Search on sorted arrays and answer-space binary search patterns.
Bits Manipulation
Bitwise operations, masks, and efficient low-level optimizations.
Data Types & Conditions
C++ data types, overflow, conditions, and branching patterns.
Dynamic Programming
Memoization, tabulation, classic DP patterns and problem decomposition.
Graph Theory
BFS, DFS, shortest paths, trees, and graph representations.
Recursion & Backtracking
Recursive thinking, call stack, and exhaustive search with pruning.
Time Complexity
Big-O analysis, amortized complexity, and performance estimation.
Two Pointers
Sliding window, opposite pointers, and linear-time range techniques.