Loading problem…
You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part. For example, the string "ababcc" can be partitioned into ["abab", "cc"], but partitions such as ["aba", "bcc"] or ["ab", "ab", "cc"] are invalid. Note that the partition is done so that after concatenating all the parts in order, the resultant string should be s. Return a list of integers representing the size of these parts.
Example 1
Input: s = ababcbacadefegdehijhklij
Output: [9,7,8]
Explanation: Every letter in "ababcbaca" (a, b, c) appears only in that part, and the same holds for "defegde" and "hijhklij". Cutting any earlier would split a letter across two parts, so the sizes are 9, 7 and 8.
Example 2
Input: s = eccbbbbdec
Output: [10]
Explanation: 'e' appears at the start and near the end, and 'c' appears at both ends, so the whole string has to stay in one part of size 10.
Example 3
Input: s = a
Output: [1]
Explanation: A single letter forms a single part of size 1.
A part cannot end until every letter it contains has had its last occurrence. Track the farthest last-occurrence as you scan; when the current index reaches it, close the part.
Run checks all cases above. Submit evaluates all test cases.