How hard is LeetCode 2917. Find the K-or of an Array?

LeetCode 2917. Find the K-or of an Array is rated Easy on LeetCode.

What is the time complexity of LeetCode 2917. Find the K-or of an Array?

The Python solution on this page runs in O(n \times \log M), where n and M are the length of the array nums and the maximum value in nums, respectively.

What is the space complexity of LeetCode 2917. Find the K-or of an Array?

The Python solution on this page uses O(1) auxiliary space.

What topics does LeetCode 2917. Find the K-or of an Array cover?

LeetCode 2917. Find the K-or of an Array is tagged Bit Manipulation and Array on LeetCode.

Find the K-or of an Array — LeetCode 2917 Python Solution

EasyBit ManipulationArray

Problem: #2917
Pattern: Bit Manipulation
Reading time: 2 min
Source: leetcode.com

The problem

You are given an integer array nums, and an integer k. Let's introduce K-or operation by extending the standard bitwise OR.

Python solution

Python

class Solution:
    def findKOr(self, nums: List[int], k: int) -> int:
        ans = 0
        for i in range(32):
            cnt = sum(x >> i & 1 for x in nums)
            if cnt >= k:
                ans |= 1 << i
        return ans

Complexity

Measure	Complexity
Time	O(n \times \log M), where n and M are the length of the array nums and the maximum value in nums, respectively
Space	O(1) auxiliary

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 2917. Find the K-or of an Array is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Bit Manipulation.

The bit manipulation guide has the Python template for the pattern and the 194 LeetCode problems that use it.

Frequently asked questions

How hard is LeetCode 2917. Find the K-or of an Array?: LeetCode 2917. Find the K-or of an Array is rated Easy on LeetCode.
What is the time complexity of LeetCode 2917. Find the K-or of an Array?: The Python solution on this page runs in O(n \times \log M), where n and M are the length of the array nums and the maximum value in nums, respectively.
What is the space complexity of LeetCode 2917. Find the K-or of an Array?: The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 2917. Find the K-or of an Array cover?: LeetCode 2917. Find the K-or of an Array is tagged Bit Manipulation and Array on LeetCode.