Non-Alternating Binary Partitions

You are given a binary string s and an integer frame. Split s into the minimum number of non-overlapping contiguous substrings so that every substring satisfies both rules:

• Its length is at most frame.
• It is not perfectly alternating.

A perfectly alternating substring changes bit at every adjacent position, such as 01, 10, or 1010. The source sample uses single-character substrings in a valid answer, so FastPrep treats a single-character substring as allowed.