Leetcode 2405. Optimal Partition of String
Partition the lowercase string into the fewest contiguous substrings so that no substring contains a repeated character. With |s| up to 1e5, the core challenge is finding this minimum efficiently (linear/greedy) under the uniqueness constraint.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.