STANDINGS
Your board
Stored in this browser only. Clearing site data, or the button below, wipes the ladder. Cloud accounts are a later swarm.
Ladder completion
—%
0/45 lessons · 0/7 games · 0/36 accepted
Lessons
- Thinking in Constraints--
- Arrays as the Contest Workbench--
- Recursion and the Call Stack--
- Brute Force and When to Stop--
- Sorting and Sets--
- Greedy: Stay Ahead or Exchange--
- Prefix Sums: Range Answers for Free--
- Two Pointers: Shrink the Search--
- Binary Search on Answers--
- Sliding Window: Expand, Shrink, Payload--
- Coordinate Compression--
- BFS: Shortest Paths on Unweighted Graphs--
- DFS: Connectivity, Cycles, Recursion--
- Dijkstra and 0-1 BFS: When Not to Use a Heap--
- Topological Order: Kahn and Finish Times--
- Union-Find: Parent, Rank, Path Compression--
- Minimum Spanning Trees--
- 0/1 Knapsack--
- Unbounded Knapsack and Coin Change--
- Longest Increasing Subsequence--
- Grid Paths: Counts and Min Sums--
- Next Greater Element--
- Heaps and Priority Queues--
- Fenwick Trees: Point Update, Prefix Sum--
- Segment Trees: The Mental Model--
- GCD and the Euclidean Algorithm--
- Sieve and Factorization--
- Modular Exponentiation--
- Binomial Coefficients mod p--
- Rolling Hash--
- KMP and the Prefix Function--
- Z-Algorithm--
- Tree Diameter--
- Binary Lifting and LCA--
- Euler Tour of a Tree--
- DP on Trees--
- Bitmask DP--
- Interval DP--
- Digit DP--
- Max Flow and Min Cut--
- Orientation, Cross Products, Hulls--
- Reading a Problem--
- Debugging Under a Clock--
- When to Skip--
- Constructive and Ad Hoc--
Games
Arena
- Two Sum--
- Valid Parentheses--
- Range Sum--
- Maximum Subarray--
- First True--
- Number of Islands--
- Frequency Mode--
- Longest Subarray Sum at Most K--
- Minimum Eating Speed--
- Capacity to Ship Packages--
- Grid Shortest Path--
- Course Schedule--
- 0/1 Knapsack--
- Coin Change--
- Longest Increasing Subsequence--
- Min Path Sum--
- Distinct Numbers--
- Movie Festival--
- Road Reparation--
- Next Greater--
- Connect Ropes--
- Fenwick Queries--
- GCD of an Array--
- Count Primes--
- Modular Exponentiation--
- Binomial Coefficient--
- String Matching--
- Distinct Substrings of Length K--
- Subtree Sizes--
- Tree Diameter--
- LCA Queries--
- Traveling Salesman--
- Matrix Chain--
- Count Without a Digit--
- Download Speed--
- Point Location Test--