Jumping Bunny

CodeChefOpen on judge ↗

You are given a binary string where '0' represents a safe place and '1' represents danger zone. Bunny is standing at 0th position and she needs to reach the last position without ever going into the danger zone.It is guaranteed that first and last position will be '0'. Bunny can take jumps of size 1 and 3 i.e if bunny is standing at index x, she can either go to x + 1 or x + 3. Unfortunate it m

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