LC-0898 Medium LeetCode

898. Bitwise ORs of Subarrays

Array Dynamic Programming Bit Manipulation

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 41% Topics: Array, Dynamic Programming, Bit Manipulation

Reading material

Arrays & Hashing 12 min 1-D Dynamic Programming 16 min Bit Manipulation 10 min

Reference solution (spoiler · python)

# Time:  O(32 * n)
# Space: O(1)

class Solution(object):
    def subarrayBitwiseORs(self, A):
        """
        :type A: List[int]
        :rtype: int
        """
        result, curr = set(), {0}
        for i in A:
            curr = {i} | {i | j for j in curr}
            result |= curr
        return len(result)

Solution from kamyu104/LeetCode-Solutions · MIT