Leetcode 3144. Minimum Substring Partition of Equal Character Frequency

Partition the string into the fewest contiguous substrings such that each substring is "balanced" (every distinct character in the substring appears the same number of times). The task is to compute this minimum split count — typically solved by checking balanced substrings (via frequency/prefix counts) and using dynamic programming to find optimal splits.