COMPETITIVE
PROGRAMMING
SESSIONS.
Recorded sessions, detailed explanations, and curated practice problems covering the most important algorithms and data structures in competitive programming.
Curriculum
Topics Covered
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.
01Bits Manipulation
Bitwise operations, masks, and efficient low-level optimizations.
?:Data Types & Conditions
C++ data types, overflow, conditions, and branching patterns.
DPDynamic Programming
Memoization, tabulation, classic DP patterns and problem decomposition.
GGraph Theory
BFS, DFS, shortest paths, trees, and graph representations.
↺Recursion & Backtracking
Recursive thinking, call stack, and exhaustive search with pruning.
OTime Complexity
Big-O analysis, amortized complexity, and performance estimation.
←→Two Pointers
Sliding window, opposite pointers, and linear-time range techniques.
What's inside
Everything you need to get started
Session Recordings
Watch full ICPC SCU lecture recordings linked directly from each topic page.
Curated Materials
Hand-picked video tutorials and reading materials from top educators like Dr. Mostafa Saad and Adel Nasim.
Practice Problems
Codeforces problem sheets for every topic — practice what you've learned immediately.
Structured Curriculum
Topics ordered from fundamentals to advanced, built for learners competing in ICPC and similar contests.