Available question text
Given a lowercase string, repeatedly remove any two equal adjacent characters until no more removals are possible and return the resulting (unique) string. Solve in linear time using a stack or in-place two-pointer simulation to handle lengths up to 1e5.
Related questions
Continue with questions that share topics or the same question type.
- Remove All Adjacent Duplicates in String II
Coding · Stack · String
- Asked LC medium problems. Problems were not difficult, even without preparation--all related to string manipulation or array manipulation.
Coding
- Check If a String Contains All Binary Codes of Size K
Coding
- Count Unique Characters of All Substrings of a Given String
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 3 records
Goldman Sachs
Leetcode 1047. Remove All Adjacent Duplicates In String
Reported Feb 28, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceMeta
Leetcode 1047. Remove All Adjacent Duplicates In String
Reported Mar 10, 2025 · 3 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View sourceWhatnot
Leetcode 1047. Remove All Adjacent Duplicates In String
Reported Sep 30, 2026 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source