Problem Statement Given: Positions of stalls k cows Place the cows in stalls such that: Minimum distance between any two cows is maximized. Return the maximum possible minimum distance. Brute Force Intuition In an interview, you can explain it like this: We can try every possible distance from 1 up to the maximum distance between stalls. For each distance, check whether all cows can be placed while maintaining at least that gap. This works but is inefficient. Complexity Time Complexity: O(N × Ma