How to solve this question?

Do anyone have editorial for this question? Or any approach? Contest Page | CodeChef

You can always find a subarray of size 2 which has the maximum bitwise and, so we just need to look at the right and left neighbours.

1 Like

Thank You