Competitive Programming

Syntax, fast I/O, control flow, functions, and memory basics in C++.

Vectors, pairs, sets, maps, priority queues, and iterators.

Big-O notation, amortized analysis, constraints, and operation counts.

Prefix sums, two pointers, sliding window, frequency hashing, and basic string manipulation.

State transitions, recursive trees, subsets, permutations, and pruning.

Binary search on answers, tree traversals, lowest common ancestor (LCA), and tree queries.

BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Kruskal/Prim MST, and Disjoint Set Union (DSU).

Memoization, iterative DP, 0/1 knapsack, longest common subsequence, and bitmask DP.

Segment trees with lazy propagation, Fenwick trees, number theory, and string hashes.

Virtual contests, live rounds, debugging under pressure, and upsolution discipline.

3-person team synergy, problem triage, stress testing, and mock regionals.