Partition Labels

Split the string into as many parts as possible so that every letter appears in at most one part. Print the sizes of the parts, in order.

Example: ababcbacadefegdehijhklij → ababcbaca | defegde | hijhklij → 9 7 8.

Input: one line s (lowercase letters).

Output: the part sizes on one line.

Constraints: 1 ≤ length of s ≤ 10⁵.

Think about it: first record the last index of every letter. Then scan: the current part must extend at least to the last occurrence of every letter seen in it. When the scan index reaches that boundary, close the part.