Leetcode 1539. Kth Missing Positive Number
Given a sorted strictly increasing array of positive integers, find the k-th positive integer missing from the sequence. Observe that the count of missing numbers up to index i is arr[i] - (i+1), which lets you locate the correct interval and compute the answer in O(log n) with binary search.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid October, 2025
Meta
Mid-level
Mid September, 2025
Meta
Staff
Early September, 2025
Meta
Senior
Your account is free and you can post anonymously if you choose.