Run Length

CodeChefOpen on judge ↗

Fluffy the squirrel has just learned about Run Length Encoding! Naturally, he has came up with the following problem, which is now presented to you in the qualifiers. You're given a binary string, i.e. a sequence of bits where each bit is either 0 or 1, of length n. Define the number of runs of the binary string as the minimum number of parts you can partition the string into so that all the bits

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