{"id":"kth-missing-binary-search-ologn","text":"`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.","truth_value":"IN","source":"entries/2026/06/06/kth-missing-positive-number-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"kth-missing-binary-search-ologn","truth_value":"IN","reason":"premise"}]}}