Question

How to find the smallest missing number from sorted array in JavaScript

Answer 1

function findSmallestMissingNumber(arr) {
    let min = arr[0];
    const len = arr.length;
      
    for (let i = 1; i < len; i++) {
        if (arr[i] > min + 1) {
            return min + 1;
        } else {
            min = arr[i];
        }
    }
      
    return -1;
}
                      
const arr = [18, 19, 20, 27, 33, 36, 40, 42];

console.log(findSmallestMissingNumber(arr));
  
  
  
  
/*
run:
  
21
  
*/

 

70+ SQL courses for beginners and professionals