Available question text
Repeatedly delete the leftmost adjacent pair of letters that are consecutive in the alphabet (treating 'a' and 'z' as consecutive) until no such pairs remain, and return the resulting string. This is a greedy/stack-like simulation solvable in linear time for the given length constraint.
Related questions
Continue with questions that share topics or the same question type.
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 · 1 record
No company association
Leetcode 3561. Resulting String After Adjacent Removals
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source