Longest Subarray

CodeChefRating 2267Open on judge ↗

You are given an array $A$ of length $N$. Find the **maximum length** of any subarray of $A$, such that, the [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) of all the elements of the subarray is equal to the [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) of the remaining elements of the array. Report $-1$ if no such subarray exists. Note: - A subarray is fo

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