From 37b4f363ee3ab8d8f7ed2015f2f0ef71f2fb481c Mon Sep 17 00:00:00 2001
From: ganesh <gnevercodes@gmail.com>
Date: Wed, 11 Feb 2026 11:47:04 -0600
Subject: [PATCH] Implement containsDuplicate method in leetcode217 using
 HashSet

---
 NEET150/Arrays&Hashing/leetcode217.java | 28 +++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 NEET150/Arrays&Hashing/leetcode217.java

diff --git a/NEET150/Arrays&Hashing/leetcode217.java b/NEET150/Arrays&Hashing/leetcode217.java
new file mode 100644
index 0000000..f32ba8a
--- /dev/null
+++ b/NEET150/Arrays&Hashing/leetcode217.java
@@ -0,0 +1,28 @@
+
+import java.util.*;
+
+public class leetcode217 {
+
+    class Solution {
+
+        public boolean containsDuplicate(int[] nums) {
+            HashSet<Integer> seen = new HashSet<>(); // hashset
+            for (int num : nums) {
+                if (seen.contains(num)) {
+                    return true;
+                }
+                seen.add(num);
+            }
+            return false;
+
+        }
+    }
+}
+
+/**
+ * use hashset 
+ * iterate over a for loop 
+ * if the hashset contains the number we are trying to insert 
+ * insert that and return true
+ * or else false. 
+ */