My solution to leet code problems!

Author: preetisharma0123

217_Contains_Duplicate.py

@@ -0,0 +1,36 @@
+""""
+217. Contains Duplicate
+
+Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
+
+ 
+
+Example 1:
+
+Input: nums = [1,2,3,1]
+Output: true
+
+Example 2:
+
+Input: nums = [1,2,3,4]
+Output: false
+
+Example 3:
+
+Input: nums = [1,1,1,3,3,4,3,2,4,2]
+Output: true
+"""
+
+class Solution(object):
+    def containsDuplicate(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: bool
+        """
+        dict1 = {}
+        for i in range(len(nums)):
+            if nums[i] in dict1:
+                return True
+            else:
+                dict1[nums[i]] = 1
+        return False

219_Contains_Duplicate II

@@ -0,0 +1,41 @@
+"""
+219. Contains Duplicate II
+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.
+
+ 
+
+Example 1:
+
+Input: nums = [1,2,3,1], k = 3
+Output: true
+
+Example 2:
+
+Input: nums = [1,0,1,1], k = 1
+Output: true
+
+Example 3:
+
+Input: nums = [1,2,3,1,2,3], k = 2
+Output: false
+
+ """
+ class Solution(object):
+    def containsNearbyDuplicate(self, nums, k):
+        """
+        :type nums: List[int]
+        :type k: int
+        :rtype: bool
+        """
+        dict1 = {}
+
+        for i in range(len(nums)):
+            if nums[i] in dict1:
+                return True
+            else:
+                dict1[nums[i]]=i
+            if (len(dict1))>k:
+                dict1.pop(nums[i-k])
+        
+        
+        return False