Available question text
Given an uppercase string, repeatedly delete any occurrence of the substrings "AB" or "CD" (concatenation after deletions may create new occurrences) and return the minimum achievable length. The core challenge is simulating these local cancellation rules efficiently—effectively a linear-time stack-like reduction to find which characters remain.
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 2696. Minimum String Length After Removing Substrings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source