Problem 3670 · Medium

Maximum Product of Two Integers With No Common Bits

Check every pair of elements; a pair qualifies when the bitwise AND is zero, and the best qualifying product is kept.

Open the interactive visualisation