How hard is LeetCode 2980. Check if Bitwise OR Has Trailing Zeros?

LeetCode 2980. Check if Bitwise OR Has Trailing Zeros is rated Easy on LeetCode.

What is the time complexity of LeetCode 2980. Check if Bitwise OR Has Trailing Zeros?

The Python solution on this page runs in O(n), where n is the length of the array.

What is the space complexity of LeetCode 2980. Check if Bitwise OR Has Trailing Zeros?

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

What topics does LeetCode 2980. Check if Bitwise OR Has Trailing Zeros cover?

LeetCode 2980. Check if Bitwise OR Has Trailing Zeros is tagged Bit Manipulation and Array on LeetCode.

Check if Bitwise OR Has Trailing Zeros — LeetCode 2980 Python Solution

EasyBit ManipulationArray

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

The problem

You are given an array of positive integers nums. You have to check if it is possible to select two or more elements in the array such that the bitwise OR of the selected elements has at least one trailing zero in its binary representation.

Example

Input: nums = [1,2,3,4,5]
Output: true
Explanation: If we select the elements 2 and 4, their bitwise OR is 6, which has the binary representation "110" with one trailing zero.

Python solution

Python

class Solution:
    def hasTrailingZeros(self, nums: List[int]) -> bool:
        return sum(x & 1 ^ 1 for x in nums) >= 2

Complexity

Measure	Complexity
Time	O(n), where n is the length of the array
Space	O(1) auxiliary

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 2980. Check if Bitwise OR Has Trailing Zeros 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 2980. Check if Bitwise OR Has Trailing Zeros?: LeetCode 2980. Check if Bitwise OR Has Trailing Zeros is rated Easy on LeetCode.
What is the time complexity of LeetCode 2980. Check if Bitwise OR Has Trailing Zeros?: The Python solution on this page runs in O(n), where n is the length of the array.
What is the space complexity of LeetCode 2980. Check if Bitwise OR Has Trailing Zeros?: The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 2980. Check if Bitwise OR Has Trailing Zeros cover?: LeetCode 2980. Check if Bitwise OR Has Trailing Zeros is tagged Bit Manipulation and Array on LeetCode.