Search⌘ K
AI Features

Solution: Kth Missing Positive Number

Understand how to apply modified binary search to identify the kth missing positive integer in a strictly increasing array. Learn to calculate missing counts and adjust search bounds efficiently. This lesson enhances problem-solving skills with logarithmic time complexity solutions.

Statement

Given a strictly increasing array arr of positive integers and a positive integer k, return the kthk^{th} positive integer that is missing from arr.

Constraints:

  • 11 \leq arr.length 103\leq 10^3 ...