Binary Search Leetcode problem ( 1760. Minimum Limit of Balls in a Bag )

VIDEO 54

Following is sample java code.

class Solution {

    public boolean isPossible(int[] arr , int operations , int k)
    {
        for(int i=0;i<arr.length;i++)
        {
            if(arr[i]>k)
            {
                int c = arr[i]/k;
                if(arr[i]%k !=0 )
                    c++;
                operations-=(c-1);    
            }
            if(operations<0)
            return false;
        }
        return true;
    }
    public int minimumSize(int[] nums, int maxOperations) {

        int l = 1;
        int r = (int)Math.pow(10,9);
        while(l<=r)
        {
            int mid = l + (r-l)/2;
            if(isPossible(nums,maxOperations , mid))
            r = mid - 1;
            else
            l = mid +1;
        }
        return l ;

    }
}