Longest Happy String
Build the longest string from copies of a, b and c so that no three identical letters appear in a row. The visual fills the string one character at a time and shows the remaining letter counts.
Build the longest string from copies of a, b and c so that no three identical letters appear in a row. The visual fills the string one character at a time and shows the remaining letter counts.