Remove All Adjacent Duplicates In String LeetCode Exercise || LeetCode #1047

Описание

Remove All Adjacent Duplicates In String LeetCode Exercise || LeetCode #1047

Question Description:
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.

Question Link:https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/



#leetcodedailychallenge #leetcodequestionandanswers #Leetcode 1047 #strings #stack #java#leetcodejava#datastructure#programming