Introduction
Build Info
Reference
1.
Framework
2.
Code Quality
3.
Communication
4.
Failure Analysis
5.
Readiness Checklist
6.
Review Template
7.
Spaced Repetition
Schedules
8.
12-Week Accelerated
9.
6-Month Serious
10.
12-Month Elite
6-Month Serious Track (Implementation)
11.
Track Overview
12.
How to Use This Track
13.
Month 01 — Foundations
❱
13.1.
Week 01 — Arrays, Hashing, Two-Pointer Warmup
❱
13.1.1.
p01 — Two Sum
❱
13.1.1.1.
Hints
13.1.2.
p02 — Valid Parentheses
❱
13.1.2.1.
Hints
13.1.3.
p03 — Best Time to Buy/Sell Stock
❱
13.1.3.1.
Hints
13.1.4.
p04 — Merge Sorted Array
❱
13.1.4.1.
Hints
13.1.5.
p05 — Climbing Stairs
❱
13.1.5.1.
Hints
13.2.
Week 02 — Linked Lists + Kadane Intro
❱
13.2.1.
p06 — Reverse Linked List
❱
13.2.1.1.
Hints
13.2.2.
p07 — Merge Two Sorted Lists
❱
13.2.2.1.
Hints
13.2.3.
p08 — Linked List Cycle
❱
13.2.3.1.
Hints
13.2.4.
p09 — Maximum Subarray
❱
13.2.4.1.
Hints
13.2.5.
p10 — Contains Duplicate
❱
13.2.5.1.
Hints
13.3.
Week 03 — Trees Intro: Recursion as the Default Tool
❱
13.3.1.
p11 — Invert Binary Tree
❱
13.3.1.1.
Hints
13.3.2.
p12 — Maximum Depth of Binary Tree
❱
13.3.2.1.
Hints
13.3.3.
p13 — Same Tree
❱
13.3.3.1.
Hints
13.3.4.
p14 — Diameter of Binary Tree
❱
13.3.4.1.
Hints
13.3.5.
p15 — Symmetric Tree
❱
13.3.5.1.
Hints
13.4.
Week 04 — BST & Tree Traversal Discipline
❱
13.4.1.
p16 — Validate Binary Search Tree
❱
13.4.1.1.
Hints
13.4.2.
p17 — Lowest Common Ancestor of BST
❱
13.4.2.1.
Hints
13.4.3.
p18 — Kth Smallest Element in BST
❱
13.4.3.1.
Hints
13.4.4.
p19 — Convert Sorted Array to BST
❱
13.4.4.1.
Hints
13.4.5.
p20 — Binary Tree Level Order Traversal
❱
13.4.5.1.
Hints
14.
Month 02 — Patterns
❱
14.1.
Week 05 — Graphs Intro: BFS, DFS, and the Topological Mindset
❱
14.1.1.
p21 — Number of Islands
❱
14.1.1.1.
Hints
14.1.2.
p22 — Clone Graph
❱
14.1.2.1.
Hints
14.1.3.
p23 — Course Schedule
❱
14.1.3.1.
Hints
14.1.4.
p24 — Pacific Atlantic Water Flow
❱
14.1.4.1.
Hints
14.1.5.
p25 — Word Ladder
❱
14.1.5.1.
Hints
14.2.
Week 06 — Two Pointers + Sliding Window: Linear-Time Mastery
❱
14.2.1.
p26 — 3Sum
❱
14.2.1.1.
Hints
14.2.2.
p27 — Container With Most Water
❱
14.2.2.1.
Hints
14.2.3.
p28 — Trapping Rain Water
❱
14.2.3.1.
Hints
14.2.4.
p29 — Longest Substring Without Repeating Characters
❱
14.2.4.1.
Hints
14.2.5.
p30 — Minimum Window Substring
❱
14.2.5.1.
Hints
14.3.
Week 07 — Prefix Sums + Binary Search: The Logarithmic Mindset
❱
14.3.1.
p31 — Subarray Sum Equals K
❱
14.3.1.1.
Hints
14.3.2.
p32 — Range Sum Query 2D Immutable
❱
14.3.2.1.
Hints
14.3.3.
p33 — Search in Rotated Sorted Array
❱
14.3.3.1.
Hints
14.3.4.
p34 — Find Minimum in Rotated Sorted Array
❱
14.3.4.1.
Hints
14.3.5.
p35 — Median of Two Sorted Arrays
❱
14.3.5.1.
Hints
14.4.
Week 08 — Backtracking: The Decision-Tree Discipline
❱
14.4.1.
p36 — Permutations
❱
14.4.1.1.
Hints
14.4.2.
p37 — Combinations
❱
14.4.2.1.
Hints
14.4.3.
p38 — Subsets
❱
14.4.3.1.
Hints
14.4.4.
p39 — Word Search
❱
14.4.4.1.
Hints
14.4.5.
p40 — N-Queens
❱
14.4.5.1.
Hints
14.5.
Week 09 — Heap/Top-K: Streaming Order Statistics
❱
14.5.1.
p41 — Kth Largest Element in an Array
❱
14.5.1.1.
Hints
14.5.2.
p42 — Top K Frequent Elements
❱
14.5.2.1.
Hints
14.5.3.
p43 — Find Median from Data Stream
❱
14.5.3.1.
Hints
14.5.4.
p44 — Merge K Sorted Lists
❱
14.5.4.1.
Hints
14.5.5.
p45 — Reorganize String
❱
14.5.5.1.
Hints
14.6.
Week 10 — Intervals: The Sort-Then-Sweep Toolkit
❱
14.6.1.
p46 — Merge Intervals
❱
14.6.1.1.
Hints
14.6.2.
p47 — Insert Interval
❱
14.6.2.1.
Hints
14.6.3.
p48 — Non-overlapping Intervals
❱
14.6.3.1.
Hints
14.6.4.
p49 — Meeting Rooms II
❱
14.6.4.1.
Hints
14.6.5.
p50 — Employee Free Time
❱
14.6.5.1.
Hints
14.7.
Week 11 — Monotonic Stack: The Next-Greater Toolkit
❱
14.7.1.
p51 — Daily Temperatures
❱
14.7.1.1.
Hints
14.7.2.
p52 — Next Greater Element I
❱
14.7.2.1.
Hints
14.7.3.
p53 — Next Greater Element II
❱
14.7.3.1.
Hints
14.7.4.
p54 — Largest Rectangle in Histogram
❱
14.7.4.1.
Hints
14.7.5.
p55 — Trapping Rain Water
❱
14.7.5.1.
Hints
14.8.
Week 12 — Foundational DP + Graphs Bridge
❱
14.8.1.
p56 — House Robber
❱
14.8.1.1.
Hints
14.8.2.
p57 — Coin Change
❱
14.8.2.1.
Hints
14.8.3.
p58 — Longest Increasing Subsequence
❱
14.8.3.1.
Hints
14.8.4.
p59 — Longest Common Subsequence
❱
14.8.4.1.
Hints
14.8.5.
p60 — Edit Distance
❱
14.8.5.1.
Hints
14.8.6.
p61 — Partition Equal Subset Sum
❱
14.8.6.1.
Hints
14.8.7.
p62 — Course Schedule II
❱
14.8.7.1.
Hints
14.8.8.
p63 — Network Delay Time
❱
14.8.8.1.
Hints
14.8.9.
p64 — Cheapest Flights Within K Stops
❱
14.8.9.1.
Hints
14.8.10.
p65 — Number of Connected Components
❱
14.8.10.1.
Hints
15.
Month 03 — Graphs + DP
❱
15.1.
Week 13 — Advanced Graphs
❱
15.1.1.
p66 — Min Cost to Connect All Points
❱
15.1.1.1.
Hints
15.1.2.
p67 — Is Graph Bipartite?
❱
15.1.2.1.
Hints
15.1.3.
p68 — Critical Connections in a Network
❱
15.1.3.1.
Hints
15.1.4.
p69 — Alien Dictionary
❱
15.1.4.1.
Hints
15.1.5.
p70 — Reconstruct Itinerary
❱
15.1.5.1.
Hints
15.2.
Week 14 — Advanced DP
❱
15.2.1.
p71 — Burst Balloons
❱
15.2.1.1.
Hints
15.2.2.
p72 — Regular Expression Matching
❱
15.2.2.1.
Hints
15.2.3.
p73 — Interleaving String
❱
15.2.3.1.
Hints
15.2.4.
p74 — Distinct Subsequences
❱
15.2.4.1.
Hints
15.2.5.
p75 — Palindrome Partitioning II
❱
15.2.5.1.
Hints
15.3.
Week 15 — Bitmask & Game DP
❱
15.3.1.
p76 — Dungeon Game
❱
15.3.1.1.
Hints
15.3.2.
p77 — Strange Printer
❱
15.3.2.1.
Hints
15.3.3.
p78 — Cherry Pickup
❱
15.3.3.1.
Hints
15.3.4.
p79 — Stone Game II
❱
15.3.4.1.
Hints
15.3.5.
p80 — Number of Ways to Wear Different Hats
❱
15.3.5.1.
Hints
16.
Month 04 — Greedy & Systems
❱
16.1.
Week 16 — Greedy Mastery & Exchange Arguments
❱
16.1.1.
p81 — Queue Reconstruction by Height
❱
16.1.1.1.
Hints
16.1.2.
p82 — Gas Station
❱
16.1.2.1.
Hints
16.1.3.
p83 — Task Scheduler
❱
16.1.3.1.
Hints
16.1.4.
p84 — Min Arrows to Burst Balloons
❱
16.1.4.1.
Hints
16.1.5.
p85 — Split Array Largest Sum
❱
16.1.5.1.
Hints
16.2.
Week 17 — Advanced Greedy & Scheduling
❱
16.2.1.
p86 — Meeting Rooms II
❱
16.2.1.1.
Hints
16.2.2.
p87 — Reorganize String
❱
16.2.2.1.
Hints
16.2.3.
p88 — IPO
❱
16.2.3.1.
Hints
16.2.4.
p89 — Course Schedule III
❱
16.2.4.1.
Hints
16.2.5.
p90 — Single-Threaded CPU
❱
16.2.5.1.
Hints
16.3.
Week 18 — Advanced Data Structures
❱
16.3.1.
p91 — Range Sum Query Mutable
❱
16.3.1.1.
Hints
16.3.2.
p92 — Count of Smaller Numbers After Self
❱
16.3.2.1.
Hints
16.3.3.
p93 — Implement strStr / KMP
❱
16.3.3.1.
Hints
16.3.4.
p94 — Repeated DNA Sequences
❱
16.3.4.1.
Hints
16.3.5.
p95 — Sliding Window Maximum
❱
16.3.5.1.
Hints
16.4.
Week 19 — Practical Engineering: Design & Parsing
❱
16.4.1.
p96 — Basic Calculator II
❱
16.4.1.1.
Hints
16.4.2.
p97 — Text Justification
❱
16.4.2.1.
Hints
16.4.3.
p98 — Design Circular Queue
❱
16.4.3.1.
Hints
16.4.4.
p99 — Design Log Storage System
❱
16.4.4.1.
Hints
16.4.5.
p100 — Design In-Memory File System
❱
16.4.5.1.
Hints
17.
Month 05 — Hards + Systems
❱
17.1.
Week 20 — Cache & High-Throughput Design
❱
17.1.1.
p101 — LFU Cache
❱
17.1.1.1.
Hints
17.1.2.
p102 — Design Hit Counter
❱
17.1.2.1.
Hints
17.1.3.
p103 — Design Twitter
❱
17.1.3.1.
Hints
17.1.4.
p104 — Design Autocomplete System
❱
17.1.4.1.
Hints
17.1.5.
p105 — All O(1) Data Structure
❱
17.1.5.1.
Hints
Phase 0 — Execution Baseline
18.
Overview
❱
18.1.
Lab 01 — Problem Reading
18.2.
Lab 02 — Constraints Extraction
18.3.
Lab 03 — Brute Force First
18.4.
Lab 04 — Optimization
18.5.
Lab 05 — Manual Testing
18.6.
Lab 06 — Communication
18.7.
Lab 07 — Stuck Recovery
Phase 1 — Foundations
19.
Overview
❱
19.1.
Lab 01 — Array Fundamentals
19.2.
Lab 02 — String Mechanics
19.3.
Lab 03 — HashMap Mastery
19.4.
Lab 04 — Linked List Pointers
19.5.
Lab 05 — Stack & Queue Applications
19.6.
Lab 06 — Heap & Priority Queue
19.7.
Lab 07 — Binary Search Fundamentals
19.8.
Lab 08 — Recursion & Stack
19.9.
Lab 09 — Tree Traversal Fundamentals
Phase 2 — Patterns
20.
Overview
❱
20.1.
Lab 01 — Two Pointers
20.2.
Lab 02 — Sliding Window
20.3.
Lab 03 — Prefix Sums
20.4.
Lab 04 — Binary Search on Answer
20.5.
Lab 05 — Monotonic Stack
20.6.
Lab 06 — Intervals
20.7.
Lab 07 — Topological Sort
20.8.
Lab 08 — Backtracking
20.9.
Lab 09 — Heap Top-K
Phase 3 — Advanced Data Structures
21.
Overview
❱
21.1.
Lab 01 — Segment Tree Range Query
21.2.
Lab 02 — Segment Tree Lazy Propagation
21.3.
Lab 03 — Fenwick Tree
21.4.
Lab 04 — Sparse Table & RMQ
21.5.
Lab 05 — KMP String Match
21.6.
Lab 06 — Rolling Hash
21.7.
Lab 07 — Trie Applications
21.8.
Lab 08 — Bitmask DP
21.9.
Lab 09 — Meet in the Middle
21.10.
Lab 10 — Z-Function & Manacher
21.11.
Lab 11 — LCA via Binary Lifting
21.12.
Lab 12 — Sqrt Decomposition & Mo's Algorithm
21.13.
Lab 13 — Treap & Ordered Set
Phase 4 — Graphs
22.
Overview
❱
22.1.
Lab 01 — BFS Shortest Path
22.2.
Lab 02 — DFS Connected Components
22.3.
Lab 03 — Multi-Source BFS
22.4.
Lab 04 — Dijkstra
22.5.
Lab 05 — Bellman-Ford
22.6.
Lab 06 — Topological Sort
22.7.
Lab 07 — Union-Find Applications
22.8.
Lab 08 — MST Kruskal
22.9.
Lab 09 — Graph Modeling
22.10.
Lab 10 — SCC & 2-SAT
22.11.
Lab 11 — Bridges & Articulation Points
22.12.
Lab 12 — Eulerian Path
Phase 5 — Dynamic Programming
23.
Overview
❱
23.1.
Lab 01 — 1D DP Foundations
23.2.
Lab 02 — 2D DP
23.3.
Lab 03 — 0/1 Knapsack
23.4.
Lab 04 — Unbounded Knapsack
23.5.
Lab 05 — LIS
23.6.
Lab 06 — LCS & Edit Distance
23.7.
Lab 07 — Palindrome DP
23.8.
Lab 08 — Tree DP
23.9.
Lab 09 — Interval DP
23.10.
Lab 10 — Bitmask DP
23.11.
Lab 11 — Digit DP
23.12.
Lab 12 — SOS DP
Phase 6 — Greedy
24.
Overview
❱
24.1.
Lab 01 — Interval Scheduling
24.2.
Lab 02 — Jump Game
24.3.
Lab 03 — Task Scheduler
24.4.
Lab 04 — Gas Station
24.5.
Lab 05 — Huffman Coding
24.6.
Lab 06 — Greedy vs DP
Phase 7 — Competitive Techniques
25.
Overview
❱
25.1.
Lab 01 — Modular Arithmetic
25.2.
Lab 02 — Binary Exponentiation
25.3.
Lab 03 — Sieve & Factorization
25.4.
Lab 04 — Sweep Line
25.5.
Lab 05 — Coordinate Compression
25.6.
Lab 06 — Stress Testing
25.7.
Lab 07 — Combinatorics mod p
25.8.
Lab 08 — XOR Linear Basis
25.9.
Lab 09 — Randomized Algorithms
Phase 8 — Practical Engineering
26.
Overview
❱
26.1.
Lab 01 — LRU Cache
26.2.
Lab 02 — LFU Cache
26.3.
Lab 03 — Rate Limiter
26.4.
Lab 04 — Task Scheduler
26.5.
Lab 05 — Thread Pool
26.6.
Lab 06 — Job Queue
26.7.
Lab 07 — Autocomplete
26.8.
Lab 08 — Log Parser
26.9.
Lab 09 — File Deduplication
26.10.
Lab 10 — Consistent Hashing
26.11.
Lab 11 — Message Dispatcher
26.12.
Lab 12 — Pub/Sub
26.13.
Lab 13 — Timer Wheel
26.14.
Lab 14 — KV Store
26.15.
Lab 15 — Retry & Backoff
26.16.
Lab 16 — Circuit Breaker
26.17.
Lab 17 — Metrics Collector
26.18.
Lab 18 — Web Crawler
26.19.
Lab 19 — In-Memory FS
26.20.
Lab 20 — Snake Game
26.21.
Lab 21 — Tic-Tac-Toe
26.22.
Lab 22 — Text Editor
26.23.
Lab 23 — SQL-Like Engine
Phase 9 — Language & Runtime
27.
Overview
❱
27.1.
Python
27.2.
JavaScript / TypeScript
27.3.
Java
27.4.
Go
27.5.
C++
Phase 10 — Testing & Debugging
28.
Overview
❱
28.1.
Lab 01 — Edge Case Taxonomy
28.2.
Lab 02 — Test-Driven Problem Solving
28.3.
Lab 03 — Debugging Under Pressure
28.4.
Lab 04 — Correctness Proofs
28.5.
Lab 05 — Stress Testing Harness
28.6.
Lab 06 — Performance Profiling
Phase 11 — Mock Interviews
29.
Overview
❱
29.1.
Mock 01 — Beginner
29.2.
Mock 02 — Easy LeetCode
29.3.
Mock 03 — Medium LeetCode
29.4.
Mock 04 — Hard LeetCode
29.5.
Mock 05 — Big Tech Phone
29.6.
Mock 06 — Big Tech Onsite
29.7.
Mock 07 — Senior Engineer
29.8.
Mock 08 — Staff Practical
29.9.
Mock 09 — Runtime & Language
29.10.
Mock 10 — Infrastructure & Backend
29.11.
Mock 11 — Concurrency
29.12.
Mock 12 — Competitive Style
Phase 12 — Grandmaster
30.
Overview
❱
30.1.
Lab 01 — Max Flow (Dinic)
30.2.
Lab 02 — Bipartite Matching
30.3.
Lab 03 — Heavy-Light Decomposition
30.4.
Lab 04 — Centroid Decomposition
30.5.
Lab 05 — Suffix Automaton
30.6.
Lab 06 — Advanced DP Optimization
30.7.
Lab 07 — FFT & Polynomial Multiplication
30.8.
Lab 08 — Advanced Geometry
30.9.
Lab 09 — ICPC Contest Simulation
30.10.
Lab 10 — Inclusion-Exclusion & Burnside
30.11.
Lab 11 — Suffix Array & Kasai LCP
30.12.
Lab 12 — Aho-Corasick Automaton
30.13.
Lab 13 — Min-Cost Max-Flow
30.14.
Lab 14 — Game Theory: Sprague-Grundy
30.15.
Lab 15 — Persistent Segment Tree
Phase 13 — Frontier
31.
Overview
❱
31.1.
Lab 01 — IDA* & Pattern Databases
31.2.
Lab 02 — Kociemba's Two-Phase Algorithm
31.3.
Lab 03 — Bidirectional BFS
31.4.
Lab 04 — Algorithm X & Dancing Links
31.5.
Lab 05 — Big-Integer Arithmetic & Karatsuba
31.6.
Lab 06 — Miller-Rabin & Pollard's Rho
31.7.
Lab 07 — Extended Euclid & CRT
31.8.
Lab 08 — Baby-Step Giant-Step
31.9.
Lab 09 — Matrix Exponentiation
31.10.
Lab 10 — Exact TSP: Held-Karp & Branch-and-Bound
Light
Rust
Coal
Navy
Ayu
LeetCode Interview — Extreme Coding
📖
Published
· commit
4521719
· 2026-07-13 02:17 UTC