LeetCode: Contains Duplicate II
Problem:
https://leetcode.com/problems/contains-duplicate-ii/
Code:
class Solution:
def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
# window = k
seen_in_window = set()
for i in range(len(nums)):
...
is-power-of-two.hashnode.dev2 min read