solves design hash set

Author: anishLearnsToCode

Diff for: README.md

@@ -1,8 +1,8 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-172/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-172/2081-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-172/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-173/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-173/2081-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-173/2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
 
@@ -193,7 +193,7 @@
 | 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [![Java](assets/java.png)](src/SearchInBinarySearchTree.java) [![Python](assets/python.png)](python/search_in_binary_search_tree.py) |
 | 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [![Java](assets/java.png)](src/KthLargestElementInAStream.java) [![Python](assets/python.png)](python/k_th_largest_element_in_a_stream.py) |
 | 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [![Java](assets/java.png)](src/BinarySearch.java) [![Python](assets/python.png)](python/binary_search.py) |
-| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | |
+| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | [![Java](assets/java.png)](src/DesignHashSet.java) [![Python](assets/python.png)](python/design_hash_set.py) |
 | 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | |
 | 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | |
 | 716 | [Max Stack](https://leetcode.com/problems/max-stack) | |

Diff for: python/design_hash_set.py

@@ -0,0 +1,32 @@
+class Bucket:
+    def __init__(self):
+        self.list = []
+
+    def contains(self, element: int) -> bool:
+        return element in self.list
+
+    def add(self, element: int) -> None:
+        self.list.append(element)
+
+    def remove(self, element: int) -> None:
+        if self.contains(element):
+            self.list.remove(element)
+
+
+class MyHashSet:
+    def __init__(self):
+        self._initial_size = 100
+        self.size = 0
+        self.buckets = [Bucket() for _ in range(self._initial_size)]
+
+    def add(self, key: int) -> None:
+        hashCode = key % len(self.buckets)
+        if not self.buckets[hashCode].contains(key):
+            self.buckets[hashCode].add(key)
+            self.size += 1
+
+    def remove(self, key: int) -> None:
+        self.buckets[key % len(self.buckets)].remove(key)
+
+    def contains(self, key: int) -> bool:
+        return self.buckets[key % len(self.buckets)].contains(key)

Diff for: src/DesignHashSet.java

@@ -0,0 +1,61 @@
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class DesignHashSet {
+    class MyHashSet {
+
+        private static final int INITIAL_SIZE = 100;
+        private final Bucket[] buckets;
+        private int size = 0;
+
+        public MyHashSet() {
+            this.buckets = new Bucket[INITIAL_SIZE];
+            initializeBuckets();
+        }
+
+        public MyHashSet(int initialSize) {
+            this.buckets = new Bucket[initialSize];
+            initializeBuckets();
+        }
+
+        public void add(int element) {
+            int hash = element % buckets.length;
+            if (!buckets[hash].contains(element)) {
+                buckets[hash].add(element);
+                this.size++;
+            }
+        }
+
+        public void remove(int element) {
+            buckets[element % buckets.length].remove(element);
+        }
+
+        public boolean contains(int element) {
+            return buckets[element % buckets.length].contains(element);
+        }
+
+        private void initializeBuckets() {
+            for (int index = 0 ; index < buckets.length ; index++) {
+                buckets[index] = new Bucket();
+            }
+        }
+
+        private static class Bucket {
+            Queue<Integer> list = new LinkedList<>();
+
+            public boolean contains(int element) {
+                return list.contains(element);
+            }
+
+            public void add(int element) {
+                if (!this.contains(element)) {
+                    list.add(element);
+                }
+            }
+
+            public void remove(int element) {
+                list.remove(element);
+            }
+        }
+    }
+}