Advanced

Enrichment

This area is for topics that sit above the usual contest core: algorithm-design ideas, deeper theory, and enrichment lanes that explain the wider landscape.

Use This Area When

• your core workflow is already stable and the bottleneck is modeling judgment
• you want stronger contest process, not just one more algorithm name
• you need to distinguish high-ROI deep tools from theory-breadth enrichment

Start With One Route

If your bottleneck is...	Open first	Then
process and reliable execution	Algorithm Engineering	Contest Engineering
exact-search breadth	Meet-In-The-Middle	Randomized Algorithms, Constructive
relaxations and optimization viewpoints	Optimization And Duality	Simplex, Approximation And Relaxation
theory-breadth enrichment	Complexity And Hardness	the corresponding breadth lane only if you intentionally want it

Core Progression

1. High-ROI first
2. Algorithm Engineering
3. Contest Engineering
4. Constructive
5. Randomized Algorithms

6. Meet-In-The-Middle

7. Then add

8. Online Algorithms
9. Complexity And Hardness
10. Approximation And Relaxation

11. Optimization And Duality

12. Breadth and theory later

13. Simplex / Matroid Intersection
14. Machine Learning Algorithms / Gradient Descent
15. Quantum Algorithms / Parallel Algorithms

Good First Repo Anchors

• Minimum Euclidean Distance
• Meet in the Middle
• Cheese, If You Please
• Pick Your Own Nim

Browse All Subtopics

• 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

Go Deeper

• Course: MIT Randomized Algorithms
• Course: Princeton COS 521
• Course: Cornell CS 6820
• Course: Berkeley CS174