Search
⌘K
Get Premium
Leetcode 3125. Maximum Number That Makes Result of Bitwise AND Zero
Given an array of nonnegative integers and an upper bound, find the largest integer k (within the allowed range) such that k & num == 0 for every array element — i.e., choose bit positions that are zero in all numbers to maximize k under the constraint. This is a bitmask/greedy problem about identifying free bit positions and constructing the maximum valid bitset.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.