Amazon SDE-1/2/SDE-Intern OA Questions | Amazon OA Questions | Kumar K | August 2026 |Set 240

Question

Comments

public static long getMinCost(int[] arr) {
    int n = arr.length;
    if (n == 1) return 0;
    
    long minCost = Long.MAX_VALUE;
    int currentLength = 1;
    
    for (int i = 1; i < n; i++) {
        if (arr[i] == arr[i-1]) {
            currentLength++;
        } else {
            // Calculate cost for the previous group
            long cost = (long)(n - currentLength) * arr[i-1];
            minCost = Math.min(minCost, cost);
            currentLength = 1;
        }
    }
    
    // Don't forget the last group
    long cost = (long)(n - currentLength) * arr[n-1];
    minCost = Math.min(minCost, cost);
    
    return minCost;
}

Answer 1

public static long getMinCost(int[] arr) {
    int n = arr.length;
    if (n == 1) return 0;
    
    long minCost = Long.MAX_VALUE;
    int currentLength = 1;
    
    for (int i = 1; i < n; i++) {
        if (arr[i] == arr[i-1]) {
            currentLength++;
        } else {
            // Calculate cost for the previous group
            long cost = (long)(n - currentLength) * arr[i-1];
            minCost = Math.min(minCost, cost);
            currentLength = 1;
        }
    }
    
    // Don't forget the last group
    long cost = (long)(n - currentLength) * arr[n-1];
    minCost = Math.min(minCost, cost);
    
    return minCost;
}