Aggressive cows
Given positions of n stalls on a number line (array stalls) and an integer c, place c cows in distinct stalls so that the minimum distance between any two cows is as large as possible. Return that maximized minimum distance. 2 <= c <= len(stalls) <= 1e5.
Implement
max_min_cow_distance(stalls: list[int], c: int) → intExamples
in
[[1,2,8,4,9],3]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 24 min
solution.py
InputExpectedGot
[[1,2,8,4,9],3]3not run yetsample