Enrollments Closing Soon for Online Instructor-Led DevOps Certification Training by CloudxLab | No Cost EMI AvailableEnroll Now
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.
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".
Sconsists only of English lowercase letters.
Complete the below code in the right side coding panel
def remove_duplicates(S: str) -> str: # your code goes here
No hints are availble for this assesment
Answer is not availble for this assesment
Note - Having trouble with the assessment engine? Follow the steps listed here