Contains Duplicate II LeetCode solution in Python

1
# Runtime: 632 ms (Top 95.72%) | Memory: 27.2 MB (Top 74.47%)
2
class Solution:
3
    def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
4
        seen = {}
5
        for i, n in enumerate(nums):
6
            if n in seen and i - seen[n] <= k:
7
                return True
8
            seen[n] = i
9
        return False