Min max stack example

contents/stacks_and_queues/code/javascript/min-max-stack.js

@@ -0,0 +1,33 @@
+class MinMaxStack {
+    constructor(){
+        this.minMaxStack =[];
+        this.stack = [];
+    }
+        peek(){
+            return this.stack[this.stack.length -1];
+        }
+
+        pop(){
+            this.minMaxStack.pop();
+            return this.stack.pop();
+        }
+
+         push(number){
+             const newMinMax = { min:number, max:number };
+             if(this.minMaxStack.length){
+                 const lastMinMax = this.minMaxStack[this.minMaxStack.length-1];
+                 newMinMax.min = Math.min(lastMinMax.min, number);
+                 newMinMax.max = Math.max(lastMinMax.max, number);
+             }
+             this.minMaxStack.push(newMinMax);
+             this.stack.push(number);
+         }
+
+         getMin(){
+             return this.minMaxStack[this.minMaxStack.length-1].min;
+         }
+
+         getMax(){
+            return this.minMaxStack[this.minMaxStack.length-1].max;
+        }
+};

contents/stacks_and_queues/stacks_and_queues.md

@@ -13,6 +13,17 @@ For the most part, though, queues and stacks are treated the same way. There mus
 
 The notation for this depends on the language you are using. Queues, for example, will often use `dequeue()` instead of `pop()` and `front()` instead of `top()`. You will see the language-specific details in the source code under the algorithms in this book, so for now it's simply important to know what stacks and queues are and how to access elements held within them.
 
+## Example Code
+
+{% method %}
+{% sample lang="js" %}
+[import, lang:"javascript"](code/javascript/min-max-stack.js)
+{% endmethod %}
+
+<script>
+MathJax.Hub.Queue(["Typeset",MathJax.Hub]);
+</script>
+
 ## License
 
 ##### Code Examples