Kth Missing Positive Number

EasyArrayBinary Search

Solution

export function findKthPositive(arr: number[], k: number): number {
  let [start, end] = [0, arr.length];
  while (start < end) {
    const mid = Math.floor((start + end) / 2);
    if (arr[mid] - mid - 1 < k) {
      start = mid + 1;
    } else {
      end = mid;
    }
  }
  return end + k;
}