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.
Return a list of integers representing the size of each part in order.
Note: the partition must cover the entire string, and the parts must be contiguous substrings.
Input: s = "ababcbacadefegdehijhklij" Output: [9, 7, 8] Explanation: Partition is "ababcbaca", "defegde", "hijhklij". Each letter appears in at most one part.
Input: s = "eccbbbbdec" Output: [10] Explanation: All characters are part of overlapping groups, so the entire string is one partition.
s = "ababcbacadefegdehijhklij"