Kth Missing Positive Number LeetCode solution in Python

1
# Runtime: 121 ms (Top 20.23%) | Memory: 14 MB (Top 53.50%)
2
class Solution:
3
    def findKthPositive(self, arr: List[int], k: int) -> int:
4
        arr = set(arr)
5
        i = 0
6
        missed = 0
7
        while missed != k:
8
            i += 1
9
            if i not in arr:
10
                missed += 1
11
        return i