Advanced Ladders¶
This section is for enrichment after the contest core feels stable.
These ladders are not the first place to spend time if your foundations, data structures, graphs, DP, strings, and geometry are still shaky.
Current Ladders¶
- Constructive
- Randomized Algorithms
- Meet-In-The-Middle
- Online Algorithms
- Machine Learning Algorithms
- Gradient Descent
- Quantum Algorithms
- Parallel Algorithms
- Algorithm Engineering
- Complexity And Hardness
- Approximation And Relaxation
- Optimization And Duality
- Simplex
- Matroid Intersection
- Contest Engineering
Mode Split¶
These ladders are not all the same kind of practice lane:
direct-note / compare-point hybrid: Constructive, Algorithm Engineering, Randomized Algorithmsbridge exact-search lane: Meet-In-The-Middleworkflow-heavy: Contest Engineeringtheory-first / compare-point lanes: Online Algorithms, Machine Learning Algorithms, Gradient Descent, Quantum Algorithms, Parallel Algorithms, Complexity And Hardness, Approximation And Relaxation, Optimization And Dualityimplementation-heavy exact-optimization lanes: Simplex, Matroid Intersection
Use the theory-first lanes for judgment building, not as if they were rep-dense ladders like the core areas.
Recommended Order¶
- algorithm engineering
- contest engineering
- constructive
- randomized algorithms
- complexity and hardness
- meet-in-the-middle
- online algorithms
- machine learning algorithms
- gradient descent
- approximation and relaxation
- optimization and duality
- simplex
- matroid intersection
- quantum algorithms
- parallel algorithms
How To Use This Section¶
- study one topic at a time
- tie every theory page back to a concrete code habit or problem pattern
- stop if the topic is interesting but not yet high-ROI for your current level
- treat this section as maturity training, not a replacement for core practice