Partition Labels

Medium

You are given a string s. Partition it into as many parts as possible so that each letter appears in at most one part. Return a list of the sizes of these parts, in order.

Example 1

Input:  s = "ababcbacadefegdehijhklij"
Output: [9,7,8]

Example 2

Input:  s = "eccbbbbdec"
Output: [10]

Constraints

• 1 <= s.length <= 500
• s consists of lowercase English letters.