1
# Runtime: 309 ms (Top 14.94%) | Memory: 18.7 MB (Top 36.81%)
2
class Solution:
3
    def removeDuplicates(self, s: str, k: int) -> str:
4
        stack = []
5
        res = ""
6
        for i in range(len(s)):
7
            if len(stack) == 0:
8
                stack.append([s[i], 1])
9
            elif stack[-1][0] == s[i]:
10
                stack[-1][1] = stack[-1][1] + 1
11
            else:
12
                stack.append([s[i], 1])
13
            if stack[-1][1] == k:
14
                stack.pop()
15
        for i in range(len(stack)):
16
            res += stack[i][0] * stack[i][1]
17
        return res