GFG PTOD | 17th Dec | Aggressive Cows

bool isPossible(int mid, int k, vector<int> &stalls) {
        int count = 1;
        int lastPos = stalls[0];
        
        for(int i=1; i < stalls.size(); i++) {
            if(stalls[i] - lastPos >= mid) {
                count++;
                lastPos = stalls[i];
                if(count == k) {
                    return true;
                }
            }
        }
        
        return false;
    }
    
    int aggressiveCows(vector<int> &stalls, int k) {

        // Write your code here
        sort(stalls.begin(), stalls.end());
        
        int low = 1;
        int high = stalls.back() - stalls.front();
        int res = 0;
        
        while(low <= high) {
            int mid = low + (high - low) / 2;
            if(isPossible(mid, k, stalls)) {
                res = mid;
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }
        return res;
    }