High and Low

CodeChefOpen on judge ↗

Mark is dealing with machine level language, i.e., 0's and 1's. He has been provided with string S consisting of all 0 and 1. His job is to check if all the '1' digits form a single non-empty segment in the given string S. Input Format The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The only line of each test case

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