CodingMediumcod-g566

Subject Binary searchLevel Mid–Senior~24 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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) → int

Examples

in[[1,2,8,4,9],3]out3

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.