#3144

Minimum Substring Partition of Equal Character Frequency

expert · 1025 · lc medium +32 · 40% accepted · 176 likes · top 19%

Description

Given a string s, split it into the fewest possible balanced substrings (a balanced string has every character appearing equally often). Return the minimum number of parts.

Code

1

2

3

class Solution:
    def minimumSubstringsInPartition(self, s: str) -> int:

class Solution:
    def minimumSubstringsInPartition(self, s: str) -> int: