Admissions guidance, study banks, and career tools — get started on Shalyam

Sign in Get started

Maximum AND of Any Pair

Medium Bitmask Subset Enumeration

Log in to solve

Print the largest value of a[i] AND a[j] over all pairs i < j.

Constraints

2 <= n <= 10^5

Discussion

No discussions yet.