443. String Compression

Author: bibhuti9

Easy/1047. Remove All Adjacent Duplicates In String.js

@@ -0,0 +1,22 @@
+/*
+    1047. Remove All Adjacent Duplicates In String
+    https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/
+*/
+
+/*  TIME COMPLEXITY O(N) */
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var removeDuplicates = function (s) {
+    let arrStack = []      // Create a stack whic contain non-repeate element
+    for (const ch of s) {
+        if (arrStack.length && arrStack[arrStack.length - 1] === ch)    // If the stack top elemt is match to the string character then remove that top element.
+            arrStack.pop()
+        else arrStack.push(ch)  // if not match add to the array.
+    }
+    return arrStack.join('')
+};
+
+console.log(removeDuplicates("aababaab"));

Easy/121. Best Time to Buy and Sell Stock.js

@@ -0,0 +1,51 @@
+/*
+    121. Best Time to Buy and Sell Stock
+    https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
+
+*/
+
+/**
+ * @param {number[]} prices
+ * @return {number}
+ */
+
+// This is the solution but Time Limit Exceeded
+
+/*Method 1 */
+/*  TIME COMPLEXITY O(N) */
+
+var maxProfit2 = function (prices) {
+    var minimumSofar = prices[0]; // Create a minimum veriable to store the minimux value in the array
+    var maxProfit = 0;  // Create a maximum veriable to store the maximun value
+    for (let i = 0; i < prices.length; i++) {
+        {
+            if (minimumSofar > prices[i]) { // Check that the Ith possitino value is less then the minimum value if condition is true modify the minimum value to new value.
+                minimumSofar = prices[i];
+            }
+
+            if ((prices[i] - minimumSofar) > maxProfit) {   // check Ith possition value minus minimum value profit is greater then the MaxProfit if condition is true then modify our maxProfit
+                maxProfit = (prices[i] - minimumSofar);
+            }
+        }
+    }
+    return maxProfit;
+}
+
+/*Method 2 */
+/*  TIME COMPLEXITY O(N2) */
+
+var maxProfit1 = function (prices) {
+    var max = 0;
+    var start = 0;
+    for (let i = 1; i < prices.length; i++) {
+        if ((prices[start] < prices[i]) && (prices[i] - prices[start]) > max) {
+            max = prices[i] - prices[start];
+        }
+        if (i == prices.length - 1) {
+            i = ++start;
+        }
+    }
+    return max;
+
+}
+console.log(maxProfit2([7, 1, 5, 3, 6, 4]));

Medium/443. String Compression.js

@@ -0,0 +1,81 @@
+/*
+    443. String Compression 
+    https://leetcode.com/problems/string-compression/
+*/
+
+/**
+ * @param {character[]} chars
+ * @return {number}
+ */
+/*
+
+Input:
+["a"]
+Output:
+[]
+Expected:
+["a"]
+
+Input:
+["a","a","a","b","b","a","a"]
+Output:
+["a","5","b","2"]
+Expected:
+["a","3","b","2","a","2"]
+
+Input:
+["a","b","b","b","b","b","b","b","b","b","b","b","b"]
+Output:
+["a","b","12"]
+Expected:
+["a","b","1","2"]
+
+
+*/
+
+
+var compress = function (chars) {
+    if (chars.length == 1) {
+        return chars.length;
+    }
+    var currentValue = chars[0];
+    var count = 1;
+    var arr = [];
+    for (let i = 1; i < chars.length; i++) {
+        if (currentValue === chars[i]) {
+            count++;
+        } else {
+            arr.push(currentValue);
+            if (count > 9) {
+                `${count}`.split("").map((value) => {
+                    arr.push(value);
+                });
+            } else {
+                if (count != 1) {
+                    arr.push(count.toString());
+                }
+            }
+            currentValue = chars[i];
+            count = 1;
+        }
+
+        if (i == chars.length - 1) {
+            arr.push(currentValue);
+            if (count > 9) {
+                `${count}`.split("").map((value) => {
+                    arr.push(value);
+                });
+            } else {
+                if (count != 1) {
+                    arr.push(count.toString());
+                }
+            }
+        }
+    }
+    chars.splice(0);
+    for (let i = 0; i < arr.length; i++) {
+        chars.push(arr[i]);
+    }
+    return chars;
+};
+console.log(compress(["a", "b", "b", "b", "c", "c", "a", "a", "a"]));