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. ### Constraints - `1 <= s.length <= 10^5` - `s` consists only of lowercase English letters. ### Input Format A single line containing the string `s`. ### Output Format Print the resulting string. If empty, print an empty line.