177. Partition Labels

Medium

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: s = "ababcbacadefegdehijhklij"

Output: [9,7,8]

Explanation: Input: s = "ababcbacadefegdehijhklij" Output: [9,7,8] Explanation: The partition is "ababcbaca", "defegde", "hijhklij". This is a partition so that each letter appears in at most one part. A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits s into less parts.

Example 2:

Input: s = "eccbbbbdec"

Output: [10]

Explanation: The entire string "eccbbbbdec" forms a single partition because 'e' appears at index 0 and its last occurrence is at index 9. All other characters ('c', 'b', 'd') also have their last occurrences within this range [0, 9].

Constraints:

•

Time Complexity

O(n)

Space Complexity

O(1)

177. Partition Labels

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

177. Partition Labels

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases