Kth Missing Positive Number: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

First Missing Positive
Coding
Kth Smallest Number in Multiplication Table
Coding
Minimum Adjacent Swaps to Reach the Kth Smallest Number
Coding
Missing Number
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Meta
Leetcode 1539. Kth Missing Positive Number
Reported Jan 4, 2026 · 14 source reports
MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View source

Kth Missing Positive Number

Available question text

Related questions

Kth Missing Positive Number

Available question text

Related questions