Maximum Balanced Sequence (Medium) — Practice with Code Visualizer

A sequence is considered well-balanced if it adheres to the following rules:

The sequence consists exclusively of the characters 'a', 'b', and 'c'.
No three consecutive characters in the sequence are identical (i.e., the sequence does not contain "aaa", "bbb", or "ccc" as substrings).
The count of character 'a' does not exceed a.
The count of character 'b' does not exceed b.
The count of character 'c' does not exceed c.

Given three non-negative integers a, b, and c representing the maximum allowed occurrences of each respective character, construct and return the longest possible well-balanced sequence.

If multiple sequences of maximum length satisfy the conditions, return any one of them. If no valid sequence can be constructed, return an empty string "".

Note: A substring is defined as a contiguous sequence of characters within a string.

One valid maximum-length sequence is "ccaccbcc" with length 8. Another valid answer would be "ccbccacc". Notice that 'c' appears 6 times (not exceeding 7), 'a' appears 1 time (not exceeding 1), and 'b' appears 1 time (not exceeding 1). No three consecutive characters are the same.

The sequence "aabaa" is the only valid answer with maximum length 5. Since c = 0, the character 'c' cannot appear. We use 5 'a's (out of 7 allowed) and 1 'b' (matching the limit). Using more 'a's would require consecutive 'aaa' which is not allowed.

The sequence "ababc" uses all available characters: 2 'a's, 2 'b's, and 1 'c', totaling length 5. Other valid arrangements include "abcab", "bacab", etc.