Remove All Adjacent Duplicates In String
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.
Example 1
Input
s = "abbaca"Output
"ca"In "abbaca", remove "bb" to get "aaca", then remove "aa" to get the final string "ca".
Example 2
Input
s = "azxxzy"Output
"ay"Removing the adjacent duplicate "xx" and then the adjacent duplicate "zz" leaves "ay".
Constraints
- 1 <= s.length <= 10^5
- s consists of lowercase English letters.