Binary String

CodeChefOpen on judge ↗

Lets define a good binary string. We call a binary string good, if after merging all the consecutive equal characters, the resulting string is palindrome. For example, "00110" is good, because after the merging step it will become "010". Given a binary string S, you have to find two values: - the number of good binary substrings of even length. - the number of good binary substrings of odd leng

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI