Data Structures and Algorithms Questions

5 / 13

Delete All Adjacent Duplicates In a String

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"
 Explanation: 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 <= len(S)<= 20000
  • S consists only of English lowercase letters.

  1. Write your code inside a function named remove_duplicates
  2. There are no partial marks for the question.
  3. Your function must return the output, it should not print the output.
  4. To execute a block on the right-side coding panel, please press 'shift'+ 'enter' inside the block.
  5. Your code should work for all permitted possible values(check Constraints) of S

Complete the below code in the right side coding panel

def remove_duplicates(S: str) -> str:
    # your code goes here
See Answer

No hints are availble for this assesment

Note - Having trouble with the assessment engine? Follow the steps listed here

Loading comments...