Goldman Sachs | Analyst | Bengaluru & Hyderabad | OA

Round 1

Questions:

Question 1:

class Result {
    public static int nonRepeatingDigitProductCount(int x, int y, int z) {
        int count = 0;

        for (int i = y; i <= z; i++) {
            int product = x * i;
            if (isValid(i, product)) {
                count++;
            }
        }

        return count;
    }

    private static boolean isValid(int num, int product) {
        boolean[] digitSeen = new boolean[10];

        int temp = num;
        while (temp > 0) {
            digitSeen[temp % 10] = true;
            temp /= 10;
        }

        while (product > 0) {
            if (digitSeen[product % 10]) {
                return false;
            }
            product /= 10;
        }

        return true;
    }
}

Question 2:

class Result {
    public static int requiredAmountAtStart(List<Integer> netSaving) {
        int startSum = 0, currentSum = 0;
        
        for(int i=0; i<netSaving.size(); i++){
            currentSum = currentSum + netSaving.get(i);
            if(currentSum <=0){
                startSum = startSum + Math.abs(currentSum)+1;
                currentSum = currentSum + startSum;
            }
        }
        return startSum;
    }
}