Question

How to find the missing values in a sorted range (x to y) array with Java

Answer 1

import java.util.HashSet;
import java.util.Set;

public class FindMissingValuesInSortedRangeArray_Java {
    public static Set<Integer> FindMissingValuesInSortedRangeArray(int[] arr, int x, int y) {
        Set<Integer> missingValues = new HashSet<>();
        
        for (int i = x; i <= y; i++) {
            missingValues.add(i);
        }
        
        for (int num : arr) {
            missingValues.remove(num);
        }
        
        return missingValues;
    }
        
    public static void main(String[] args) {
        int x = 4;
        int y = 15;

        int[] arr = {5, 5, 5, 5, 6, 7, 9, 10, 10, 10, 11, 13};

        Set<Integer> missingValues = FindMissingValuesInSortedRangeArray(arr, x, y);

        System.out.println("missingValues: " + missingValues);
    }
}


/*
run:

missingValues: [4, 8, 12, 14, 15]

*/

 

70+ SQL courses for beginners and professionals