Remove All Adjacent Duplicates In String

easy
Question Solve Solutions 
You are given a string s consisting of lowercase English 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 can be proven that the answer is unique.

Input Format

String str

Output Format

String without adjacent duplicates

Constraints

1 <= s.length <= 105
s consists of lowercase English letters.

Notice

NA

Example

Input
abbaca
Output
ca
Previous
Minimize Maximum Pair Sum In Array
Next
Remove All Adjacent Duplicates In String Ii

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy GCD easy Fibonacci easy Fib Till N easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list