Search1

CodeChefOpen on judge ↗

Given an array A which stores 0 and 1, such that each entry containing 0 appears before all those entries containing 1. In other words, it is like {0, 0, 0, ... 0, 0, 1, 1, ... 1, 1, 1}. Design an algorithm to find out the small index i such that A[i] = 1 i from 0. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of two line o

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