Count Good Strings
A string is good exactly when every run of equal letters has odd length; the count reduces to Fibonacci numbers, computed by fast doubling.
A string is good exactly when every run of equal letters has odd length; the count reduces to Fibonacci numbers, computed by fast doubling.