Merge pull request #509 from anjola-adeuyi/main

Ahmad-A0 · web-flow · commit ac26cf763389 · 2022-07-19T16:14:45.000+01:00
1209. Remove All Adjacent Duplicates in String II - python and JavaScript
diff --git a/javascript/1209-Remove-All-Adjacent-Duplicates-in-String-II.js b/javascript/1209-Remove-All-Adjacent-Duplicates-in-String-II.js
@@ -0,0 +1,22 @@
+/**
+ * @param {string} s
+ * @param {number} k
+ * @return {string}
+ */
+var removeDuplicates = function (s, k) {
+  const stack = []; // [char, count];
+
+  for (const c of s) {
+    if (stack.length !== 0 && stack[stack.length - 1][0] === c) {
+      stack[stack.length - 1][1]++;
+    } else {
+      stack.push([c, 1]);
+    }
+
+    if (stack[stack.length - 1][1] === k) {
+      stack.pop();
+    }
+  }
+
+  return stack.reduce((res, el) => (res += el[0].repeat(el[1])), '');
+};
diff --git a/python/1209-Remove-All-Adjacent-Duplicates-in-String-II.py b/python/1209-Remove-All-Adjacent-Duplicates-in-String-II.py
@@ -0,0 +1,18 @@
+class Solution:
+    def removeDuplicates(self, s: str, k: int) -> str:
+        stack = [] # [char, count]
+        
+        for c in s:
+            if stack and stack[-1][0] == c:
+                stack[-1][1] += 1
+            else:
+                stack.append([c, 1])
+            
+            if stack[-1][1] == k:
+                stack.pop()
+                
+        res = ""
+        for char, count in stack:
+            res += (char * count)
+        
+        return res
