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.2.
p02 — Valid Parentheses
13.1.3.
p03 — Best Time to Buy/Sell Stock
13.1.4.
p04 — Merge Sorted Array
13.1.5.
p05 — Climbing Stairs
Phase 0 — Execution Baseline
14.
Overview
❱
14.1.
Lab 01 — Problem Reading
14.2.
Lab 02 — Constraints Extraction
14.3.
Lab 03 — Brute Force First
14.4.
Lab 04 — Optimization
14.5.
Lab 05 — Manual Testing
14.6.
Lab 06 — Communication
14.7.
Lab 07 — Stuck Recovery
Phase 1 — Foundations
15.
Overview
❱
15.1.
Lab 01 — Array Fundamentals
15.2.
Lab 02 — String Mechanics
15.3.
Lab 03 — HashMap Mastery
15.4.
Lab 04 — Linked List Pointers
15.5.
Lab 05 — Stack & Queue Applications
15.6.
Lab 06 — Heap & Priority Queue
15.7.
Lab 07 — Binary Search Fundamentals
15.8.
Lab 08 — Recursion & Stack
15.9.
Lab 09 — Tree Traversal Fundamentals
Phase 2 — Patterns
16.
Overview
❱
16.1.
Lab 01 — Two Pointers
16.2.
Lab 02 — Sliding Window
16.3.
Lab 03 — Prefix Sums
16.4.
Lab 04 — Binary Search on Answer
16.5.
Lab 05 — Monotonic Stack
16.6.
Lab 06 — Intervals
16.7.
Lab 07 — Topological Sort
16.8.
Lab 08 — Backtracking
16.9.
Lab 09 — Heap Top-K
Phase 3 — Advanced Data Structures
17.
Overview
❱
17.1.
Lab 01 — Segment Tree Range Query
17.2.
Lab 02 — Segment Tree Lazy Propagation
17.3.
Lab 03 — Fenwick Tree
17.4.
Lab 04 — Sparse Table & RMQ
17.5.
Lab 05 — KMP String Match
17.6.
Lab 06 — Rolling Hash
17.7.
Lab 07 — Trie Applications
17.8.
Lab 08 — Bitmask DP
17.9.
Lab 09 — Meet in the Middle
Phase 4 — Graphs
18.
Overview
❱
18.1.
Lab 01 — BFS Shortest Path
18.2.
Lab 02 — DFS Connected Components
18.3.
Lab 03 — Multi-Source BFS
18.4.
Lab 04 — Dijkstra
18.5.
Lab 05 — Bellman-Ford
18.6.
Lab 06 — Topological Sort
18.7.
Lab 07 — Union-Find Applications
18.8.
Lab 08 — MST Kruskal
18.9.
Lab 09 — Graph Modeling
Phase 5 — Dynamic Programming
19.
Overview
❱
19.1.
Lab 01 — 1D DP Foundations
19.2.
Lab 02 — 2D DP
19.3.
Lab 03 — 0/1 Knapsack
19.4.
Lab 04 — Unbounded Knapsack
19.5.
Lab 05 — LIS
19.6.
Lab 06 — LCS & Edit Distance
19.7.
Lab 07 — Palindrome DP
19.8.
Lab 08 — Tree DP
19.9.
Lab 09 — Interval DP
19.10.
Lab 10 — Bitmask DP
Phase 6 — Greedy
20.
Overview
❱
20.1.
Lab 01 — Interval Scheduling
20.2.
Lab 02 — Jump Game
20.3.
Lab 03 — Task Scheduler
20.4.
Lab 04 — Gas Station
20.5.
Lab 05 — Huffman Coding
20.6.
Lab 06 — Greedy vs DP
Phase 7 — Competitive Techniques
21.
Overview
❱
21.1.
Lab 01 — Modular Arithmetic
21.2.
Lab 02 — Binary Exponentiation
21.3.
Lab 03 — Sieve & Factorization
21.4.
Lab 04 — Sweep Line
21.5.
Lab 05 — Coordinate Compression
21.6.
Lab 06 — Stress Testing
Phase 8 — Practical Engineering
22.
Overview
❱
22.1.
Lab 01 — LRU Cache
22.2.
Lab 02 — LFU Cache
22.3.
Lab 03 — Rate Limiter
22.4.
Lab 04 — Task Scheduler
22.5.
Lab 05 — Thread Pool
22.6.
Lab 06 — Job Queue
22.7.
Lab 07 — Autocomplete
22.8.
Lab 08 — Log Parser
22.9.
Lab 09 — File Deduplication
22.10.
Lab 10 — Consistent Hashing
22.11.
Lab 11 — Message Dispatcher
22.12.
Lab 12 — Pub/Sub
22.13.
Lab 13 — Timer Wheel
22.14.
Lab 14 — KV Store
22.15.
Lab 15 — Retry & Backoff
22.16.
Lab 16 — Circuit Breaker
22.17.
Lab 17 — Metrics Collector
22.18.
Lab 18 — Web Crawler
22.19.
Lab 19 — In-Memory FS
22.20.
Lab 20 — Snake Game
22.21.
Lab 21 — Tic-Tac-Toe
22.22.
Lab 22 — Text Editor
22.23.
Lab 23 — SQL-Like Engine
Phase 9 — Language & Runtime
23.
Overview
❱
23.1.
Python
23.2.
JavaScript / TypeScript
23.3.
Java
23.4.
Go
23.5.
C++
Phase 10 — Testing & Debugging
24.
Overview
❱
24.1.
Lab 01 — Edge Case Taxonomy
24.2.
Lab 02 — Test-Driven Problem Solving
24.3.
Lab 03 — Debugging Under Pressure
24.4.
Lab 04 — Correctness Proofs
24.5.
Lab 05 — Stress Testing Harness
24.6.
Lab 06 — Performance Profiling
Phase 11 — Mock Interviews
25.
Overview
❱
25.1.
Mock 01 — Beginner
25.2.
Mock 02 — Easy LeetCode
25.3.
Mock 03 — Medium LeetCode
25.4.
Mock 04 — Hard LeetCode
25.5.
Mock 05 — Big Tech Phone
25.6.
Mock 06 — Big Tech Onsite
25.7.
Mock 07 — Senior Engineer
25.8.
Mock 08 — Staff Practical
25.9.
Mock 09 — Runtime & Language
25.10.
Mock 10 — Infrastructure & Backend
25.11.
Mock 11 — Concurrency
25.12.
Mock 12 — Competitive Style
Phase 12 — Grandmaster
26.
Overview
❱
26.1.
Lab 01 — Max Flow (Dinic)
26.2.
Lab 02 — Bipartite Matching
26.3.
Lab 03 — Heavy-Light Decomposition
26.4.
Lab 04 — Centroid Decomposition
26.5.
Lab 05 — Suffix Automaton
26.6.
Lab 06 — Advanced DP Optimization
26.7.
Lab 07 — FFT & Polynomial Multiplication
26.8.
Lab 08 — Advanced Geometry
26.9.
Lab 09 — ICPC Contest Simulation
26.10.
Lab 10 — Inclusion-Exclusion & Burnside
Light
Rust
Coal
Navy
Ayu
LeetCode Interview — Extreme Coding
📖
Published
· commit
406ccc0
· 2026-05-21 16:15 UTC