D. J.:

- Add the leetcode problem and solution for 219 Contains Duplicates II

Author: nobodyPerfecZ

README.md

@@ -19,6 +19,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [189 Rotate Array](https://leetcode.com/problems/rotate-array/description/)
 - [202 Happy Number](https://leetcode.com/problems/happy-number/description/)
 - [205 Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/description/)
+- [219 Contains Duplicates II](https://leetcode.com/problems/contains-duplicate-ii/description/)
 - [242 Valid Anagram](https://leetcode.com/problems/valid-anagram/description/)
 - [290 Word Pattern](https://leetcode.com/problems/word-pattern/description/)
 - [383 Ransom Note](https://leetcode.com/problems/ransom-note/description/)

awesome_python_leetcode/_219_contains_duplicate_II.py

@@ -0,0 +1,20 @@
+from typing import List
+
+
+class Solution:
+    def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
+        """
+        Given an integer array nums and an integer k, return true if there are
+        two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.
+        """
+
+        sliding_window = set()
+        left = 0
+        for right in range(len(nums)):
+            if right - left > k:
+                sliding_window.remove(nums[left])
+                left += 1
+            if nums[right] in sliding_window:
+                return True
+            sliding_window.add(nums[right])
+        return False

tests/test_219_contains_duplicates_II.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._219_contains_duplicate_II import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "k", "expected"],
+    argvalues=[
+        ([1, 2, 3, 1], 3, True),
+        ([1, 0, 1, 1], 1, True),
+        ([1, 2, 3, 1, 2, 3], 2, False),
+    ],
+)
+def test_func(nums: List[int], k: int, expected: bool):
+    contains_nearby_duplicate = Solution().containsNearbyDuplicate(nums, k)
+    assert contains_nearby_duplicate == expected