Available question text
Repeatedly remove adjacent pairs of the same letter in opposite cases (e.g., 'a' and 'A') until no such pairs remain, and return the resulting unique "good" string. This is a stack-like cancellation problem solvable by scanning and cancelling opposite-case neighbors.
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 1544. Make The String Great
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source