Completed Design 1 - Problem 1

MinStack.java

@@ -0,0 +1,2 @@
+package PACKAGE_NAME;public class MinStack {
+}

MyHashSet.java

@@ -0,0 +1,69 @@
+package amaan29;
+
+import java.util.List;
+
+class Bucket{
+    private List<Integer> container;
+
+    public Bucket(){
+        this.container=new LinkedList<Integer>();
+    }
+
+    public void insert(Integer val){
+        int index=this.container.indexOf(val);
+        if(index==-1){
+            this.container.addFirst(val);
+        }
+    }
+
+    public void remove(Integer val){
+        this.container.remove(val);
+    }
+
+    public boolean contains(Integer val){
+        int index=this.container.indexOf(val);
+        return index!=-1;
+    }
+
+}
+class MyHashSet {
+
+    //use a prime number for bucket size
+    int bucketSize=769;
+    Bucket[] buckets;
+
+    public MyHashSet() {
+        this.buckets=new Bucket[this.bucketSize];
+
+        for(int i=0; i < bucketSize; i++){
+            this.buckets[i]=new Bucket();
+        }
+    }
+
+    public int getIndex(int key){
+        return key % bucketSize;
+    }
+
+    public void add(int key) {
+        int bucketIndex=this.getIndex(key);
+        this.buckets[bucketIndex].insert(key);
+    }
+
+    public void remove(int key) {
+        int bucketIndex=this.getIndex(key);
+        this.buckets[bucketIndex].remove(key);
+    }
+
+    public boolean contains(int key) {
+        int bucketIndex=this.getIndex(key);
+        return this.buckets[bucketIndex].contains(key);
+    }
+}
+
+/**
+ * Your amaan29.MyHashSet object will be instantiated and called as such:
+ * amaan29.MyHashSet obj = new amaan29.MyHashSet();
+ * obj.add(key);
+ * obj.remove(key);
+ * boolean param_3 = obj.contains(key);
+ */