Available question text
Given a string s, you may repeatedly pick an index i whose character appears at least once both to its left and to its right and delete the nearest matching characters on each side; return the minimum possible length of s after any sequence of such operations. (1 ≤ s.length ≤ 2·10^5, lowercase letters.)
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 3223. Minimum Length of String After Operations
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source