Method repairCars

MinimumTimeToRepairCars.java:2–23

(int[] ranks, int cars)

class Solution {
    public long repairCars(int[] ranks, int cars) {
        long start = Long.MAX_VALUE;
        long end = Long.MIN_VALUE; 
        for (int rank : ranks){
            end = Math.max(end, rank);
            start = Math.min(start,rank);
        }
        end = end * cars * cars;
        long ans=0;
        while (start <= end) {
            long mid = start + (end - start) / 2;
            if (isCarsRepaired(mid, ranks,cars)){
                ans = mid;
                end=mid-1;
            } 
            else {
                start=mid+1;
            } 
        }

        return ans;
    }
    public boolean isCarsRepaired(long time, int ranks[], int carsToBeRepaired){
        long carsRepaired = 0;
            for (int rank : ranks){