Leetcode - Remove All Adjacent Duplicates In String Solution

Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them.

We repeatedly make duplicate removals on S until we no longer can.

Return the final string after all such duplicate removals have been made.  It is guaranteed the answer is unique.

Example 1:

Input: "abbaca"
Output: "ca"
For example, in "abbaca" we could remove "bb" since the letters are adjacent and equal, and this is the only possible move.  The result of this move is that the string is "aaca", of which only "aa" is possible, so the final string is "ca".


  1. 1 <= S.length <= 20000
  2. S consists only of English lowercase letters.

Solution in Python

class Solution:
    def removeDuplicates(self, S: str) -> str:
        stack = []
        for i in S:
            if not stack:
            elif stack[-1]==i:
        return "".join(stack)

Subscribe to The Poor Coder | Algorithm Solutions

Don’t miss out on the latest issues. Sign up now to get access to the library of members-only issues.
[email protected]