Tap here to switch tabs
Problem
Submissions

Problem: Minimum Substring Partition of Equal Frequency

Minimum Substring Partition of Equal Frequency divides a string into as few substrings as possible, with every distinct character appearing equally often within each substring. Return that minimum.

Statement

Given a string s, partition it into the minimum number of substrings such that every distinct character in each substring appears with the exact same frequency.

Return the minimum number of substrings obtained in such a valid partition.

Constraints:

  • 1≤1 \leq s.length ≤1000\leq 1000

  • s consists only of lowercase English letters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Substring Partition of Equal Frequency

Minimum Substring Partition of Equal Frequency divides a string into as few substrings as possible, with every distinct character appearing equally often within each substring. Return that minimum.

Statement

Given a string s, partition it into the minimum number of substrings such that every distinct character in each substring appears with the exact same frequency.

Return the minimum number of substrings obtained in such a valid partition.

Constraints:

  • 1≤1 \leq s.length ≤1000\leq 1000

  • s consists only of lowercase English letters.