Search
⌘K

Leetcode 3223. Minimum Length of String After Operations

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.)


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.