23.03.06 Today’s Leetcode

1539. Kth Missing Positive Number (easy)

class Solution:
    def findKthPositive(self, arr: List[int], k: int) -> int:
        start = 0
        end = len(arr)-1
        while start <= end:
            mid = start+(end-start)//2
            if arr[mid]-mid-1 < k:
                start = mid+1
            else:
                end = mid-1
        return start+k