Skip to main content
📜 WAYPOINT LESSON

Checkpoint — Answer Search

⭐ beginner⏳ 40 min read📍 Lesson 184 of 281

Max-min placement graded on exact-gap data where the off-by-one feasibility check fails; brute force cannot save you at n = 200000.

Checkpoint — Answer Search. Each query: n k then n positions. Print the largest d such that k positions can be chosen with every consecutive gap >= d.

Binary search d, greedy check: gaps EXACTLY d are allowed.