Merge pull request #1393 from ivan1016017/september13

algo

Author: ivan1016017

src/my_project/interviews/top_150_questions_round_19/contains_duplicate_ii.py

@@ -0,0 +1,21 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+from collections import defaultdict
+
+class Solution:
+    def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
+
+        answer_dic = defaultdict(int)
+        len_nums = len(nums)
+
+        for i in range(len_nums):
+
+            answer_dic[nums[i]] += 1
+
+            if i > k: 
+                answer_dic[nums[i - (k+1)]] -= 1
+
+            if answer_dic[nums[i]] > 1:
+                return True 
+            
+        return False

tests/test_150_questions_round_19/test_contains_duplicate_ii_round_19.py

@@ -0,0 +1,16 @@
+import unittest
+from src.my_project.interviews.top_150_questions_round_19\
+.contains_duplicate_ii import Solution
+
+class ContainsDuplicatesTestCase(unittest.TestCase):
+
+    def test_contains_duplicates(self):
+        solution = Solution()
+        output = solution.containsNearbyDuplicate(nums=[1,2,3,1], k=3)
+        self.assertTrue(output)
+
+    def test_contains_no_duplicates(self):
+        solution = Solution()
+        output = solution.containsNearbyDuplicate(nums=[1,2,3,1,2,3], k=2)
+        self.assertFalse(output)
+