Package g2401_2500.s2405_optimal_partition_of_string

Class Solution

java.lang.Object

g2401_2500.s2405_optimal_partition_of_string.Solution

public class Solution
extends Object

2405 - Optimal Partition of String.

Medium

Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a single substring more than once.

Return the minimum number of substrings in such a partition.

Note that each character should belong to exactly one substring in a partition.

Example 1:

Input: s = “abacaba”

Output: 4

Explanation:

Two possible partitions are (“a”,“ba”,“cab”,“a”) and (“ab”,“a”,“ca”,“ba”).

It can be shown that 4 is the minimum number of substrings needed.

Example 2:

Input: s = “ssssss”

Output: 6

Explanation:

The only valid partition is (“s”,“s”,“s”,“s”,“s”,“s”).

Constraints:

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

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	partitionString(String s)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

partitionString

public int partitionString(String s)