Merge branch 'master' of https://github.com/SumeetHaryani/problem-solving-javascript into logical-problems

Author: SumeetHaryani

README.md

@@ -14,17 +14,22 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct
 ### Data Structures
 
 - [Singly Linked List](src/_DataStructures_/LinkedList)
+
   - [N Element From Last](src/_DataStructures_/LinkedList/element-from-last)
   - [Middle Node](src/_DataStructures_/LinkedList/middle-node)
   - [Detect Loop](src/_DataStructures_/LinkedList/loop-in-list)
   - [Reverse Linked List](src/_DataStructures_/LinkedList/reverse-linked-list)
+
 - [Stack](src/_DataStructures_/Stack)
+
   - [Implement Queue Using Stack](src/_DataStructures_/Stack/immitate-queue-using-stack)
   - [Baseball Game](src/_DataStructures_/Stack/baseball-game)
   - [Minimum Stack](src/_DataStructures_/Stack/min-stack)
   - [Balanced Parenthesis](src/_DataStructures_/Stack/balanced-parenthesis)
   - [Postfix Expression Evaluation](src/_DataStructures_/Stack/postfix-expression-evaluation)
-
+  - [Remove Consecutive Repeated Digits](src/_DataStructures_/Stack/remove-consecutive-repeated-digits)
+  - [Implement 2 Stacks using Single Array](src/_DataStructures_/Stack/2-stacks-using1-array)
+  
 
 - [Queue](src/_DataStructures_/Queue)
   - [Weave](src/_DataStructures_/Queue/weave)
@@ -42,6 +47,7 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct
 - [Get Maze Path](src/_Problems_/get_subsequence)
 - [Get longest consecutive 1s](src/_Problems_/max-consecutive-1s)
 - [Get Max Char](src/_Problems_/maxchar)
+- [Get Smallest Common Number](src/_Problems_/get-smallest-common-number)
 - [Merge 2 Sorted Arrays](src/_Problems_/merge-two-sorted-arrays)
 - [Palindrome](src/_Problems_/palindrome)
 - [Product of Elements](src/_Problems_/product-of-elements)
@@ -67,9 +73,10 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct
 
 ## CONTRIBUTION Guide
 
-It's great to know that you want to contribute to this repo. Thanks for taking interest. Before you start, read the following carefully. 
+It's great to know that you want to contribute to this repo. Thanks for taking interest. Before you start, read the following carefully.
 
 - When adding a new **problem** with solution
+
   - Take care of the filename convention (Very Important)
   - Problem statement should be there with examples
   - Make sure you add the Run Time complexity of your solution
@@ -78,7 +85,8 @@ It's great to know that you want to contribute to this repo. Thanks for taking i
   - Strictly follow ESLINT rules
 
 - When adding a Unit Test
+
   - Take care of the file name convention
   - Make sure CI (Travis) is passing
-  
-Keep an eye on this guide, it's subjected to change frequently. 
+
+Keep an eye on this guide, it's subjected to change frequently.

src/_DataStructures_/Stack/2-stacks-using1-array/index.js

@@ -0,0 +1,85 @@
+/**
+ * Revision to PR #35 where I implemented bullshit thinking of
+ * new breakthrough :D
+ */
+
+class TwoStacks {
+  constructor(capacity) {
+    this.data = [];
+    this.top1 = -1;
+    this.top2 = capacity;
+    this.overflow = new Error('Overflow: Stack is full');
+
+    this.capacity = capacity;
+  }
+
+  push1(value) {
+    if (this.top1 < this.top2 - 1) {
+      this.top1 += 1;
+      this.data[this.top1] = value;
+    } else {
+      throw this.overflow;
+    }
+  }
+
+  push2(value) {
+    if (this.top1 < this.top2 - 1) {
+      this.top2 -= 1;
+      this.data[this.top2] = value;
+    } else {
+      throw this.overflow;
+    }
+  }
+
+  pop1() {
+    if (this.top1 >= 0) {
+      const item = this.data[this.top1];
+      delete this.data[this.top1];
+      this.top1 -= 1;
+      return item;
+    }
+    return -1;
+  }
+
+  pop2() {
+    if (this.top2 < this.capacity) {
+      const item = this.data[this.top2];
+      delete this.data[this.top2];
+      this.top2 += 1;
+      return item;
+    }
+    return -1;
+  }
+}
+
+module.exports = TwoStacks;
+
+/** Test cases */
+
+/*
+const s = new TwoStacks(4);
+
+s.push1('a');
+console.log(s.data);
+
+s.push2('a2');
+console.log(s.data);
+
+s.push1('b');
+console.log(s.data);
+
+s.push2('b2');
+console.log(s.data);
+
+s.push2('d2');
+console.log(s.data);
+
+s.push2('c23');
+console.log(s.data);
+
+console.log(s.pop2());
+console.log(s.data);
+
+console.log(s.pop1());
+console.log(s.data);
+*/

src/_DataStructures_/Stack/remove-consecutive-repeated-digits/index.js

@@ -0,0 +1,25 @@
+/**
+ * Given an integer N, remove consecutive repeated digits from it.
+ * Input:133445
+ * Output:1345
+ */
+
+const Stack = require('../index');
+
+
+function removeConsecutiveDigits(no) {
+    let s = new Stack();
+    let newNo = "";
+    //initally push first digit into stack
+    newNo += no[0];
+    s.push(no[0]);
+    for (let i = 1; i < no.length; i++) {
+        const digit = no[i];
+        //if stack top and incoming digit is same ignore it else append to newNo.
+        if (s.peek() !== digit) {
+            newNo += digit;
+            s.push(digit);
+        }
+    }
+    return newNo
+}

src/_Problems_/get-smallest-common-number/index.js

@@ -0,0 +1,29 @@
+// Get the common smallest number between two integer arrays
+
+const getSmallestCommonNumber = (a1, a2) => {
+  let map = {};
+  let i = 0;
+  let min;
+
+  while (a1.length > i || a2.length > i) {
+    if (i < a1.length) {
+      map[`${a1[i]}a`] = true;
+      if (map[`${a1[i]}b`] && (min > a1[i] || !min)) {
+        min = a1[i];
+      }
+    }
+
+    if (i < a2.length) {
+      map[`${a2[i]}b`] = true;
+      if (map[`${a2[i]}a`] && (min > a2[i] || !min)) {
+        min = a2[i];
+      }
+    }
+
+    i++;
+  }
+
+  return min || -1;
+};
+
+module.exports = { getSmallestCommonNumber };