2568. Minimum Impossible OR

MediumBit ManipulationBrainteaserArray

Problem Description

The problem provides us with an array nums that is 0-indexed. The goal is to determine the smallest positive non-zero integer that cannot be expressed as the bitwise OR of any subsequence of elements from nums.

To understand this, recall that a subsequence is a sequence that can be derived from the array by deleting some or no elements without changing the order of the remaining elements. The bitwise OR operation takes two bit patterns of equal length and performs the logical inclusive OR operation on each pair of corresponding bits. A bit is set (1) if one or both bits at that position is 1.

An integer x is expressible if x equals the result of the bitwise OR applied to a subsequence of nums. The problem asks us to find the smallest integer that is not expressible in such a way.

Intuition

Our intuition for solving this problem is based on the properties of the bitwise OR operation. Considering the nature of bitwise OR, any expressible number must be less than or equal to the sum of the max number in nums and all the largest bits set in the other numbers of nums.

Notice that if a bit is never set amongst all numbers of the array nums, then the number that has this bit as the least significant bit that is set (the smallest power of two greater than any of the numbers in nums) cannot be expressed using the given numbers. This is because you can only set a bit in the result of a bitwise OR operation if that bit is set in at least one number of the subsequence.

The solution takes advantage of this by iteratively checking, starting from the smallest power of two (1, 2, 4, 8, ...), whether each power of two is present in the set s, which contains all numbers from nums. When it finds a power of two that is not present, it returns that number as the smallest non-expressible number.

For example, if nums only contains the number 3 (nums = [3]), the smallest not expressible number would be 1 << 2, which is 4, since the numbers 1 (1 << 0) and 2 (1 << 1) are expressible from nums using the numbers 1 and 2 or 3, which when performed bitwise OR operation results in 1 and 2 respectively. However, since 4 is not in nums, no subsequence can produce a set bit at the position that corresponds to 4.

This code iterates through the powers of two until it finds one not present in the array nums—that power of two is the smallest number that can't be formed by a bitwise OR of elements of nums.

Not Sure What to Study? Take the 2-min Quiz to Find Your Missing Piece：

Solution Approach

In the provided solution, we see a straightforward approach using Python's set data structure and generator expression:

The set data structure s is created from nums to allow for constant time (O(1)) lookups when checking if a number is in the set. This operation is critical because the algorithm needs to repeatedly check for the presence of powers of two in nums.
The generator expression (1 << i for i in range(32)) iteratively computes powers of two, from 1 (i.e., 1 << 0) up to 2**31 (i.e., 1 << 31). Since nums is an array of integers, and the largest integer in a 32-bit system is 2**31 - 1, we don't need to check beyond 1 << 31.
Using Python's next function, we find the first power of two not in set s by checking if 1 << i is not in s. The next function will stop at the first occurrence where the condition matches, which is efficient because it avoids unnecessary iterations for higher powers of two that aren't needed.
The use of bitwise shift 1 << i is a clever choice because it efficiently calculates powers of two, which are exactly the numbers we need to check. Each power of two has only one bit set, starting from the least significant bit (for 1 << 0) to the 31st bit (for 1 << 31).
Finally, the result of the next function is returned, which is the first power of two that cannot be formed by 'OR'ing any subsequence of nums. This value is essentially the answer to the problem.

This approach works because, as previously described, a number that's not in nums and has a bit set that isn't set in any of nums is by definition not expressible. Since powers of two have only one bit set, they serve as perfect candidates for finding the smallest such number. This algorithm runs in O(N) time where N is the number of elements in nums due to the set construction. The rest of the operation checking for the first missing power of two runs in constant time because there is a pre-defined limit of 32 iterations (bit sizes of standard integers).

Discover Your Strengths and Weaknesses: Take Our 2-Minute Quiz to Tailor Your Study Plan:

Which algorithm is best for finding the shortest distance between two points in an unweighted graph?

Depth-First SearchBreadth-First SearchBinary SearchPriority Queue

I don’t know

Example Walkthrough

Let's use a small example to illustrate the solution approach.

Suppose our input nums array is [1, 5, 7]. We want to find the smallest positive non-zero integer that cannot be expressed as the bitwise OR of any subsequence of elements from nums.

First, we convert nums into a set s to benefit from constant time lookup. Our set s is {1, 5, 7}.
Next, we start checking for the smallest power of two that is not present in set s using the generator expression (1 << i for i in range(32)). This will produce [1, 2, 4, 8, ..., 2**31].
The bitwise OR of any subsequence of [1, 5, 7] can give us the following results:
- Using 1 from nums, bitwise OR gives us 1.
- Using 5 from nums, bitwise OR gives us 5.
- Using 7 from nums, bitwise OR gives us 7.
- By performing bitwise OR on 1 and 5, we get 1 | 5 = 5.
- By performing bitwise OR on 1 and 7, we get 1 | 7 = 7.
- By performing bitwise OR on 5 and 7, we get 5 | 7 = 7.
- By using all elements 1, 5, 7, we get 1 | 5 | 7 = 7.
From the above bitwise OR operations, we know that 1 and 5 are expressible. Now we need to check for the smallest power of two not in s.
Going through the powers of two, we find:
- 1 is in s (1 is expressible).
- 2 is not in s, but we can get 2 by expressing 1 | 1 = 2 (2 is expressible).
- 4 is not in s, and we cannot create it by using a bitwise OR on any of the available numbers since none of them has the third bit set.
Since 4 (which is 1 << 2) cannot be expressed by any subsequence of nums, it is the smallest number that cannot be formed by a bitwise OR of elements from this array. Thus, 4 is the smallest expressible number for the given nums.

By following these steps using the provided solution approach, we conclude that for the input array [1, 5, 7], the smallest positive non-zero integer that cannot be expressed as the bitwise OR of any subsequence of elements from nums is 4.

Solution Implementation

1from typing import List
2
3class Solution:
4    def minImpossibleOR(self, nums: List[int]) -> int:
5        # Create a set of unique values from the nums list for fast lookup
6        unique_numbers = set(nums)
7      
8        # Iterate over the range of 32 bits, which is sufficient for all integers
9        for i in range(32):
10            # Calculate the current power of two
11            power_of_two = 1 << i
12          
13            # Check if this power of two is not in the unique_numbers set
14            if power_of_two not in unique_numbers:
15                # Return the smallest power of two that is not in the set
16                # This value cannot be formed by OR operations of the numbers in the set
17                return power_of_two
18
19# The next() function and generator expression were replaced with a for loop
20# for improved readability and understanding.
21

1class Solution {
2    public int minImpossibleOR(int[] nums) {
3        // Initialize a hash set to store unique OR results
4        Set<Integer> uniqueORResults = new HashSet<>();
5
6        // Add all numbers from the input array to the set
7        for (int number : nums) {
8            uniqueORResults.add(number);
9        }
10
11        // Loop through each bit position starting from 0
12        for (int i = 0; ; ++i) {
13            // Calculate the current power of 2 (1 shifted i times to the left)
14            int powerOfTwo = 1 << i;
15          
16            // If the set does not contain this power of two, 
17            // it means that we've found the minimum impossible OR result
18            if (!uniqueORResults.contains(powerOfTwo)) {
19                return powerOfTwo;
20            }
21        }
22        // The loop above is infinite, as it does not have a breaking condition.
23        // It is assumed that the function will always find a minimum impossible OR
24        // and return from inside the loop.
25    }
26}
27

1#include <vector>
2#include <unordered_set>
3
4class Solution {
5public:
6    // This function finds the minimum impossible OR-sum for a given set of numbers.
7    int minImpossibleOR(vector<int>& nums) {
8        // Create a set to store unique values from nums for efficient look-up.
9        unordered_set<int> uniqueNums(nums.begin(), nums.end());
10
11        // Iterate to find the smallest power of 2 that is not present as OR-sum in nums.
12        for (int i = 0; ; ++i) {
13            // Check if the current power of 2 is missing from the set.
14            if (uniqueNums.count(1 << i) == 0) {
15                // If missing, this is the minimum impossible OR-sum, so return it.
16                return 1 << i;
17            }
18        }
19
20        // The loop is guaranteed to break at the return statement,
21        // hence there is no explicit return value outside of the loop.
22        // This works under the assumption that at some i, `1 << i` won't be in `uniqueNums`.
23    }
24};
25

1function minImpossibleOR(nums: number[]): number {
2    // Initialize a set to store unique elements from the input array
3    const uniqueElements: Set<number> = new Set();
4
5    // Iterate over the input array and add each number to the set
6    for (const num of nums) {
7        uniqueElements.add(num);
8    }
9
10    // Start checking for the smallest missing integer with 0
11    let missingInteger = 0;
12  
13    // Iterate indefinitely as we will return from within the loop when the condition is met
14    while (true) {
15        // Check if the current power of 2 (1 shifted left by missingInteger places) is not in the set
16        if (!uniqueElements.has(1 << missingInteger)) {
17            // If it's not in the set, we found our smallest missing integer and return it
18            return 1 << missingInteger;
19        }
20        // If it is in the set, increment missingInteger to check the next power of 2
21        missingInteger++;
22    }
23}
24

Not Sure What to Study? Take the 2-min Quiz：

Which technique can we use to find the middle of a linked list?

Fast-slow pointersTwo pointers moving in opposite directionBinary searchDepth first search

I don’t know

Time and Space Complexity

The time complexity of the provided code is O(1). This is because the number of iterations is bound by 32, which corresponds to the number of bits in an integer when using a standard 32-bit representation. The loop will run at most 32 times, regardless of the input size, because it checks for the presence of powers of two (using 1 << i) in the set s.

The space complexity of the code is also O(1). The set s is created with the elements of the input list nums, but this does not depend on the size of the input with respect to the range of numbers (0 to 31) we are checking. Hence, the space used by the set is constant with respect to the size of the input list. The only other space utilized is the space for the variable i and the output which is also constant.

Learn more about how to find time and space complexity quickly using problem constraints.

Fast Track Your Learning with Our Quick Skills Quiz:

Overview

Basic Data Structures

Basic Algorithms

Overview

Sorted Array

Implicitly Sorted Array

Advanced

Speedrun

Introduction

DFS on Tree

Binary Search Tree

Advanced

Combinatorial Search

Pruning

Additional States

Aggregation and Memoization

Dedup

Additional Practices

Speedrun

Introduction

BFS on Tree

Introduction

Vanilla BFS

Matrix as Graph

Implicit Graph

Directed Graph / Topological Sort

Weighted Graph

Minimum Spanning Tree

Speedrun

Introduction

Same Direction

Opposite Direction

Sliding Window

Prefix Sum

Cycle Finding

Advanced

Speedrun

Introduction

Top K

Moving Best

Multiple Heaps

Introduction

Grid

Dynamic number of subproblems

Interval

Dual-Sequence

Knapsack

Bitmask

Additional Practices

Disjoint Set Union | Union Find

Trie

Data Structure Design

Segment Tree

Interval

Monotonic Stack

Divide and Conquer

Line Sweep

Tree Traversal without Recursion

Greedy

Math

Matrix

Classics

Concepts

Projects

Amazon OA

Microsoft OA

Google OA

Twitter OA

Editorials

2568. Minimum Impossible OR

Problem Description

Intuition

Solution Approach

Example Walkthrough

Solution Implementation

Time and Space Complexity

Recommended Readings