🧩 HashSet Problems

Welcome to the HashSet section of JDCodebase!

HashSet is a powerful data structure that allows you to store **unique elements** and check for existence in **constant time** (on average). It's widely used in problems involving **duplicates, lookups**, and **set operations**.

🔍 What You’ll Learn

Detecting duplicates in arrays or strings
Fast element existence checks
Set operations like union, intersection, and difference
Real-world applications in frequency and pattern problems

🛠️ Common JavaScript Methods

const set = new Set() — create a new set
set.add(value) — add value to set
set.has(value) — check if value exists
set.delete(value) — remove value
set.size — get number of unique items
Array.from(set) — convert back to array

📝 Problems List