Kth Missing Positive Number LeetCode solution in JavaScript

1
var findKthPositive = function (arr, k) {
2
  let newArr = [];
3
  for (let i = 0, j = 1; j <= arr.length + k; j++) {
4
    arr[i] != j ? newArr.push(j) : i++;
5
  }
6
  return newArr[k - 1];
7
};