Time: 15 ms (99.16%), Space: 51.3 MB (89.78%) - LeetHub

Author: harshubhatnagar

0219-contains-duplicate-ii/0219-contains-duplicate-ii.java

@@ -0,0 +1,10 @@
+class Solution {
+    public boolean containsNearbyDuplicate(int[] nums, int k) {
+         Set<Integer> set = new HashSet<Integer>();
+        for(int i = 0; i < nums.length; i++){
+            if(i > k) set.remove(nums[i-k-1]);
+            if(!set.add(nums[i])) return true;
+        }
+        return false;
+    }
+}