Update README.md

Author: MadhavBahl

README.md

@@ -64,8 +64,12 @@ Motivate yourself to code daily till 60 days, and see the magic! Coding will bec
 | [Day 34](./day34) | [Merge Sort](./day34) | [http://codetoexpress.tech/dc/day34/](http://codetoexpress.tech/dc/day34/) | **Intermediate** |
 | [Day 35](./day35) | [Quick Sort](./day35) | [http://codetoexpress.tech/dc/day35/](http://codetoexpress.tech/dc/day35/) | **Intermediate** |
 | [Day 36](./day36) | [Radix Sort](./day36) | [http://codetoexpress.tech/dc/day36/](http://codetoexpress.tech/dc/day36/) | **Intermediate** |
+<<<<<<< HEAD
 | [Day 37](./day37) | [Radix Sort](./day37) | [http://codetoexpress.tech/dc/day37/](http://codetoexpress.tech/dc/day37/) | **Misc** |
 | [Day 38](./day38) | [Implement Stack Data Structure](./day38) | [http://codetoexpress.tech/dc/day38/](http://codetoexpress.tech/dc/day38/) | **Beginner** |
+=======
+| [Day 37](./day37) | [Search and Sort Applications](./day37) | [http://codetoexpress.tech/dc/day37/](http://codetoexpress.tech/dc/day37/) | **Misc** |
+>>>>>>> 1caed584eb7d890c0d845eff768c09495004b36b
 
 ## [More Problems](./BONUS/README.md)
 

day38/README.md

@@ -114,5 +114,72 @@ stk.peek ();
 Implementation without using JS's array push and pop methods
 
 ```js
-// to be added
+/**
+ * Implemntation of Stack Data  Structure in JavaScript
+ * @author MadhavBahlMD
+ * @date 11/02/2019
+ * Method 2 - Stack implementation from scratch (without push() and pop() methods)
+ */
+
+class Stack {
+    // Constructor function to initialize the stack
+    constructor (capacity) {
+        this.myStack = [];
+        this.cap = capacity;
+        this.first = 0;
+        this.last = 0;
+        this.size = -1;
+    }
+
+    // isEmpty() method to check whether the stack is empty
+    isEmpty () {
+        if (this.size === -1) return true;
+        return false;
+    }
+
+    //isFull() method to check whether the stack is full
+    isFull () {
+        if (this.size === this.cap -1) return true;
+        return false;
+    }
+
+    // push() method to add an element to the stack
+    push (element) {
+        if (this.isFull()) {
+            console.log ('OVERFLOW!');
+            return 0;
+        }
+        console.log (`Pushing ${element} to the stack!`);
+        this.size++;
+        this.myStack[this.size] = element;
+        return 1;
+    }
+
+    // pop() method to remove topmost element
+    pop () {
+        if (this.isEmpty()) {
+            console.log ('UNDERFLOW!');
+            return 0;
+        }
+        console.log (`Popped element is: ${this.myStack[this.size]}`);
+        this.size--;
+        return 1;
+    }
+
+    // peek() method to view the toopmost element
+    peek () {
+        if (this.isEmpty()) {
+            console.log ('Stack is empty!');
+            return 0;
+        }
+        console.log (`Current Element is: ${this.myStack[this.size]}`);
+    }
+}
+
+const stk = new Stack (10);
+stk.pop ();
+stk.push (1);
+stk.push (2);
+stk.pop ();
+stk.peek ();
 ```