Status: IN
`findKthPositive` runs in O(log n) time via binary search on the missing-count function `arr[i] - (i + 1)`, not the naive O(n) linear scan.
Source: entries/2026/06/06/kth-missing-positive-number-solution.md
JSON