Appearance
Chapter 12: Practice Ladders
Overview
Theory without practice is just trivia. This chapter is where the book turns from "I have read concepts" into "I have practiced them under pressure."
It contains eight ladders, organized into three groups:
- Core rating progression (01–03): three rating-band ladders covering CF 1100 → 2100. Hand-picked problems, ordered to expose the gaps that show up at each level.
- Topic remediation (04–07): focused single-topic ladders for DP, graphs, data structures, and strings. Use these when one topic keeps breaking your contests.
- Contest-reality mixed (08): topic tags hidden, problems shuffled. Trains the missing skill of recognizing the technique before someone tells you which chapter it belongs to.
Each problem was chosen to reinforce specific topics from earlier chapters, so you're not just solving random problems — you're climbing a deliberate skill ladder.
Where to start: a placement diagnostic
| If your contests fail because… | Use… |
|---|---|
| You can't choose the right technique under time pressure | Mixed ladder (08) — trains technique identification |
| You know the technique but implementation is slow or buggy | Rating ladder (01/02/03) — trains fluency at your level |
| One specific topic repeatedly breaks you (DP, graphs, DS, strings) | Topic ladder (04/05/06/07) — focused remediation |
| You don't know what your gaps are yet | Start with the rating ladder one band below your current rating |
Navigation
Coming from: Chapter 11 — Contest Craft — contest strategy, debugging, and study planning
Going to: Chapter 13 — Worked Solutions — detailed thinking transcripts for real contest problems
Topics at a Glance
| # | Topic | Difficulty | Key Trigger Phrase |
|---|---|---|---|
| 01 | Ladder: CF 1100 → 1400 | Beginner | "I need to solidify fundamentals and basic techniques" |
| 02 | Ladder: CF 1400 → 1700 | Intermediate | "I'm comfortable with basics, ready for data structures and graphs" |
| 03 | Ladder: CF 1700 → 2100 | Advanced | "I want to break into Expert/Candidate Master" |
| 04 | DP Mastery Ladder | Progressive | "I want focused DP practice from 1D to bitmask/tree DP" |
| 05 | Graph Mastery Ladder | Progressive | "I want focused graph practice from BFS to SCC and flows" |
| 06 | Data Structure Mastery Ladder | Progressive | "I want focused DS practice from stacks to segment trees" |
| 07 | String Mastery Ladder | Progressive | "I want focused string practice from hashing to suffix arrays" |
| 08 | Contest Reality Ladder | Progressive | "I want to simulate real contests with mixed unknown topics" |
If You Only Read 3 Files
- Ladder: CF 1100 → 1400 — even if you think you know the basics, these 50 problems expose the gaps. Implementation, sorting, greedy, prefix sums, binary search, basic DP, and BFS/DFS — if you can solve all 50 cleanly, you have a solid foundation.
- Ladder: CF 1400 → 1700 — the "intermediate gap" where many people plateau. These 50 problems target exactly the techniques (segment trees, DSU, Dijkstra, intermediate DP) that unlock consistent Div 2 D solves.
- Ladder: CF 1700 → 2100 — the problems that separate good competitors from great ones. Digit DP, tree DP, suffix arrays, lazy segment trees, Mo's algorithm, and advanced graph techniques — this is where the real growth happens.
Cross-Chapter Connections
- Ladder 1100–1400 reinforces Chapter 0: Fundamentals and Chapter 1: Essential Techniques
- Ladder 1400–1700 targets Chapter 2: Data Structures, Chapter 3: Graph Foundations, and Chapter 4: DP basics
- Ladder 1700–2100 exercises advanced topics from Chapter 5: Strings, Chapter 6: Advanced Graphs, Chapter 7: Mathematics, and Chapter 9: Offline Techniques
- Follow the Study Plan in Chapter 11 to know when to attempt each ladder
- Use the Problem Pattern Recognition guide from Chapter 10 when you're stuck on a ladder problem
File Listing
| File | Topic | Level |
|---|---|---|
| ladder-1100-to-1400 | Practice Ladder: CF 1100 → 1400 | ⭐ |
| ladder-1400-to-1700 | Practice Ladder: CF 1400 → 1700 | ⭐⭐ |
| ladder-1700-to-2100 | Practice Ladder: CF 1700 → 2100 | ⭐⭐⭐ |
| ladder-dp | DP Mastery Ladder (1200 → 1900) | ⭐–⭐⭐⭐ |
| ladder-graphs | Graph Mastery Ladder (1200 → 1900) | ⭐–⭐⭐⭐ |
| ladder-data-structures | Data Structure Mastery Ladder (1200 → 1900) | ⭐–⭐⭐⭐ |
| ladder-strings | String Mastery Ladder (1200 → 1900) | ⭐–⭐⭐⭐ |
| ladder-mixed | Contest Reality Ladder (1200 → 1900) | ⭐–⭐⭐⭐ |
Suggested Reading Order
- ladder-1100-to-1400 — implementation, simulation, and fundamentals
- ladder-1400-to-1700 — data structures and intermediate techniques
- ladder-1700-to-2100 — advanced DP, graphs, and optimization
- ladder-dp — focused DP progression: 1D → knapsack → bitmask → tree DP
- ladder-graphs — focused graph progression: BFS → Dijkstra → DSU → SCC
- ladder-data-structures — focused DS progression: stack/map → BIT → segment tree → lazy
- ladder-strings — focused string progression: hashing → KMP/Z → trie → suffix array
- ladder-mixed — contest simulation: mixed topics, technique identification practice