Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2568. Minimum Impossible OR
Find the smallest positive integer x that cannot be formed as the bitwise OR of any subsequence of nums. The key challenge is reasoning about bitwise coverage—x is expressible iff the union of all numbers whose bits are subsets of x equals x—so you must efficiently test candidate bitmasks across up to 30 bits and 1e5 numbers.
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.