Sixty-Nine Commit: Add Remove All Adjacent Duplicates In String II problem to Monotonic Stack section

Author: AAdewunmi

src/Monotonic_Stack/Problem_5_Remove_All_Adjacent_Duplicates_In_String11.java

@@ -0,0 +1,28 @@
+package Monotonic_Stack;
+
+// Problem Statement: Remove All Adjacent Duplicates in String II (medium)
+// LeetCode Question: 1209. Remove All Adjacent Duplicates in String II
+
+import java.util.Stack;
+
+public class Problem_5_Remove_All_Adjacent_Duplicates_In_String11 {
+    public String removeDuplicates(String s, int k) {
+        Stack<int[]> stack = new Stack<>();
+        for (char c : s.toCharArray()) {
+            if (!stack.isEmpty() && stack.peek()[0] == c) {
+                stack.peek()[1]++;
+            } else {
+                stack.push(new int[]{c, 1});
+            }
+            if (stack.peek()[1] == k) {
+                stack.pop();
+            }
+        }
+        StringBuilder result = new StringBuilder();
+        while (!stack.isEmpty()) {
+            int[] top = stack.pop();
+            result.append(String.valueOf((char) top[0]).repeat(top[1]));
+        }
+        return result.reverse().toString();
+    }
+}