All placement help available

Check the past proofs & placement offers

Cognizant Technical codes are available

import java.util.Arrays;

public int findCars(int input1, int[] input2, int[] input3) {
    int p = 0, r = 0;

    for (int i = 0; i < input1; i++) {
        if (input2[i] > 2) {
            p += input2[i];
        }
    }

    if (p == 0) return -1;

    Integer[] x = new Integer[input1];
    for (int i = 0; i < input1; i++) {
        x[i] = input3[i];
    }

    Arrays.sort(x, (a, b) -> b - a);

    for (int i : x) {
        if (p > 0) {
            p -= i;
            r++;
        } else {
            break;
        }
    }

    return p > 0 ? -1 : r;
}

NOW TAKING 2 PM SLOTS COGNIZANT