Another Bitwise Problem

CodeChefOpen on judge ↗

Oculus gave chef an array of integers $A$ of length n. Oculus challenged chef to find the minimum size of subarray such that bit wise and of all the elements in the sub array is zero. Since chef is busy in cooking some crazy dishes he asked you for help. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - First line of each testcase contains of a single line

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