12 weeks, 66 problems

C++ practice plan

Each week pairs one DSA pattern with the C++ and STL skills it makes you use. A problem counts as done once you solve it, with or without a hint.

Overall0/67
0 of 67
W1 C++ warm-up: vectors, strings, fast I/O vector, string, auto, range-for, ios::sync_with_stdio(false) 0/6
0 of 6
W2 STL containers + custom sorting unordered_map, map, set, multiset, pair, sort with lambda comparator 0/5
0 of 5
W3 Prefix sums + difference arrays partial_sum, long long overflow, prefix maps 0/5
0 of 5
W4 Two pointers + sliding window deque, window invariants, frequency arrays 0/6
0 of 6
W5 Binary search (incl. on the answer) lower_bound, upper_bound, monotonic predicate 0/6
0 of 6
W6 Stacks, monotonic stack, heaps stack, priority_queue with greater<>, custom heap comparator 0/6
0 of 6
W7 Greedy + interval problems sort by end, exchange argument 0/6
0 of 6
W8 Recursion + backtracking pass by reference, pruning, vector<vector<int>> 0/5
0 of 5
W9 Graphs: BFS, DFS, topo sort, DSU, Dijkstra adjacency list, queue, DSU struct, priority_queue<pair> 0/7
0 of 7
W10 Dynamic programming 1D + 2D vector<vector<long long>>, memo vs tabulation, space optimisation 0/7
0 of 7
W11 Trees + bits + math __builtin_popcount, bit masks, sieve, fast power, modulo 1e9+7 0/7
0 of 7
W12 Contest simulation timed virtual contests, own template, upsolving 0/1
0 of 1
2 past GfG Weekly contests as virtual, 90 min each, then upsolve