Practice & Tracker
Accelerate your competitive foundations. Complete visual playgrounds, solve code problems, and build portfolio projects.
Competency Checklist
Articles Read
Playgrounds Completed
Problems Solved
Portfolio Projects Built
Syllabus Pillars Index
Access all 12 modules representing competitive foundations.
Complexity Analysis
Master Big O, Big Theta, and Big Omega notation scales. Benchmark execution steps and analyze time-space tradeoffs.
Arrays
Explore linear structures, traversals, prefix sums, sliding windows, and shrinking pointer boundaries.
Strings
Master string manipulation, pattern matching, sliding windows, hashing lookup keys, and character frequency arrays.
Linked Lists
Deconstruct node chains, pointer directions, list reversals, merge operations, and Floyd cycle detection.
Stack
Master Last-In-First-Out operations, recursion stacks, monotonic sequences, and nested validations.
Queue
Explore First-In-First-Out loops, circular memory frames, double-ended queues, and priority heaps.
Hash Tables
Understand hashing maps, collision resolutions (chaining vs. open addressing), and constant-time search gates.
Trees
Deconstruct hierarchic node traversals (DFS/BFS), binary search constraints, balancing, and prefix Tries.
Heap
Optimize continuous min/max extractions using array-based binary heaps and bubble heapify steps.
Graphs
Traverse custom coordinate vertices, relax weighted edges, compute shortest paths, and sort DAG cycles.
Backtracking
Search recursive decision trees, prune failing paths, and solve permutation grid puzzles.
Dynamic Programming
Identify overlapping subproblems, store computations in tables (memoization vs tabulation), and solve Knapsacks.
Trie
Build efficient prefix trees for character retrieval. Optimize dictionary searches, autocompletes, and prefix lookups.
Binary Search
Divide search spaces in half logarithmically. Master search-space reductions and binary searching on answer thresholds.
Greedy
Make locally optimal choices at each step. Evaluate Jump Games, merge overlapping intervals, and study counterexamples.
Bit Manipulation
Interact directly with binary data in registers. Master AND, OR, XOR, shifts, and efficient bitmask logic.