Partition Labels · Coding Interview Practice

Partition LabelsPartition a string into as many parts as possible so each letter appears in at most one part. Return the sizes of the parts.Constraints

1 <= s.length <= 500

s consists of lowercase English letters

Examples

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

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

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…