contains-duplicate-ii

malipramod · malipramod · commit 2e2336d82847 · 2019-09-03T17:58:33.000+05:30
diff --git a/easy/0219 contains-duplicate-ii/contains-duplicate-ii.js b/easy/0219 contains-duplicate-ii/contains-duplicate-ii.js
@@ -0,0 +1,24 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {boolean}
+ */
+var containsNearbyDuplicate = function (nums, k) {
+    let i = 0;
+    let myMap = {};
+    while (i < nums.length) {
+        if (myMap[nums[i]] >= 0 && i - myMap[nums[i]] <= k)
+            return true;
+
+        myMap[nums[i]] = i;
+        i++;
+    }
+    return false;
+};
+
+console.log(containsNearbyDuplicate([1,2,3,1,2,3], 2))
+console.log(containsNearbyDuplicate([1,2,3,1], 3))
+console.log(containsNearbyDuplicate([1,0,1,1], 1))
+console.log(containsNearbyDuplicate([1,1,1,1], 2))
+console.log(containsNearbyDuplicate([99,99], 2))
+
diff --git a/easy/0219 contains-duplicate-ii/readme.md b/easy/0219 contains-duplicate-ii/readme.md
@@ -0,0 +1,25 @@
+# Contains Duplicate II
+
+Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most 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
+
+## More Info
+
+<https://leetcode.com/problems/contains-duplicate-ii/>
