🐄 Cow Spacing Battle

📚 Aggressive Cows Problem

Given N stalls at positions and C cows, maximize the minimum distance between any two cows.

• Binary search on answer: range is [1, max_position - min_position]
• mid = minimum distance to test
• Greedily place cows: place at first stall, then next valid stall with distance ≥ mid
• If we can place all C cows: mid works! Try larger (go right)
• If we can't: mid is too big (go left)