(self, nums: List[int], k: int)
| 1 | class Solution: |
| 2 | def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: |
| 3 | window = set() |
| 4 | L = 0 |
| 5 | |
| 6 | for R in range(len(nums)): |
| 7 | if R - L > k: |
| 8 | window.remove(nums[L]) |
| 9 | L += 1 |
| 10 | if nums[R] in window: |
| 11 | return True |
| 12 | window.add(nums[R]) |
| 13 | return False |