Merge pull request #2304 from vorenusCoA/main

Adding 0219-contains-duplicate-ii.java

Author: a93a

README.md

@@ -104,7 +104,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>Problem</sub> | <sub>C</sub> | <sub>C++</sub> | <sub>C#</sub> | <sub>Dart</sub> | <sub>GO</sub> | <sub>Java</sub> | <sub>JS</sub> | <sub>Kotlin</sub> | <sub>Python</sub> | <sub>Ruby</sub> | <sub>Rust</sub> | <sub>Scala</sub> | <sub>Swift</sub> | <sub>TS</sub>
 ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
 <sub>[0121 - Best Time to Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)</sub> | <sub><div align='center'>[✔️](c%2F0121-best-time-to-buy-and-sell-stock.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0121-best-time-to-buy-and-sell-stock.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0121-best-time-to-buy-and-sell-stock.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0121-best-time-to-buy-and-sell-stock.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0121-best-time-to-buy-and-sell-stock.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0121-best-time-to-buy-and-sell-stock.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0121-best-time-to-buy-and-sell-stock.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0121-best-time-to-buy-and-sell-stock.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0121-best-time-to-buy-and-sell-stock.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0121-best-time-to-buy-and-sell-stock.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0121-best-time-to-buy-and-sell-stock.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0121-best-time-to-buy-and-sell-stock.ts)</div></sub>
-<sub>[0219 - Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0219-Contains-Duplicate-II.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0219-contains-duplicate-ii.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0219-contains-duplicate-ii.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0219-contains-duplicate-ii.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[0219 - Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0219-Contains-Duplicate-II.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0219-contains-duplicate-ii.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0219-contains-duplicate-ii.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0219-contains-duplicate-ii.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0219-contains-duplicate-ii.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[1343 - Number of Sub Arrays of Size K and Avg Greater than or Equal to Threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0003 - Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)</sub> | <sub><div align='center'>[✔️](c%2F0003-longest-substring-without-repeating-characters.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0003-longest-substring-without-repeating-characters.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0003-longest-substring-without-repeating-characters.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0003-longest-substring-without-repeating-characters.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0003-longest-substring-without-repeating-characters.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0003-longest-substring-without-repeating-characters.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0003-longest-substring-without-repeating-characters.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0003-longest-substring-without-repeating-characters.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0003-longest-substring-without-repeating-characters.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0003-longest-substring-without-repeating-characters.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F0003-longest-substring-without-repeating-characters.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0003-longest-substring-without-repeating-characters.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0003-longest-substring-without-repeating-characters.ts)</div></sub>
 <sub>[0424 - Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)</sub> | <sub><div align='center'>[✔️](c%2F0424-longest-repeating-character-replacement.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0424-longest-repeating-character-replacement.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0424-longest-repeating-character-replacement.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0424-longest-repeating-character-replacement.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0424-longest-repeating-character-replacement.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0424-longest-repeating-character-replacement.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0424-longest-repeating-character-replacement.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0424-longest-repeating-character-replacement.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0424-longest-repeating-character-replacement.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0424-longest-repeating-character-replacement.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0424-longest-repeating-character-replacement.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0424-longest-repeating-character-replacement.ts)</div></sub>

java/0219-contains-duplicate-ii.java

@@ -0,0 +1,22 @@
+class Solution {
+    public boolean containsNearbyDuplicate(int[] nums, int k) {
+        
+        Set<Integer> window = new HashSet<>();
+        int left = 0;
+        for (int right = 0; right < nums.length; right++) {
+
+            if (window.size() > k) {
+                window.remove(nums[left]);
+                left++;
+            }
+
+            if (window.contains(nums[right])) {
+                return true;
+            }
+
+            window.add(nums[right]);
+        }
+
+        return false;
+    }
+}