Problem Brief

Minimum Substrings Without Repeating Characters

Given a string S, find the minimum number of substrings without repeating characters.

1Example 1

Input

S = "word"

Output

Explanation

The answer is 1 as "word" doesn't have any duplicates.

Input

S = "dddd"

Output

Explanation

The answer is 4 as we can only form substrings "d", "d", "d", "d".

Input

S = "cycle"

Output

Explanation

The answer is 2 as we can make substrings "cy" and "cle".

Draft autosaves locally

public int minimumSubstringsWithoutRepeatingCharacters(String s) {
  // write your code here
}

Input

"word"

Output