Practice Partition Labels

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#763

LeetCode Problem

Partition Labels

Hash Table Two Pointers String Greedy

Problem Statement

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.

Source: Partition Labels on LeetCode. Use the original task for its coding environment and submissions.

Examples

# 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.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free