LeetCode 2505: Bitwise OR of All Subsequence Sums Solution

Master LeetCode problem 2505 (Bitwise OR of All Subsequence Sums), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2505. Bitwise OR of All Subsequence Sums

Medium

Array Math Bit Manipulation Brainteaser

Problem Explanation

Explanation

The problem asks us to find the bitwise OR of all possible subsequence sums of a given array. A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

To solve this problem, we can iterate through all possible subsequences of the given array and calculate the sum of each subsequence. Then, we bitwise OR all these sums together to get the final result.

Algorithm:

Initialize a variable result to store the final bitwise OR result.
Iterate through all possible subsequences of the input array using bit manipulation.
For each subsequence, calculate the sum of its elements and bitwise OR it with result.
Return the final result.

Time Complexity: O(2^N * N) where N is the number of elements in the input array. Space Complexity: O(1)

Solution Code

class Solution {
    public int subarrayBitwiseORs(int[] arr) {
        Set<Integer> res = new HashSet<>();
        Set<Integer> cur = new HashSet<>();
        Set<Integer> next;
        
        for (int num : arr) {
            next = new HashSet<>();
            next.add(num);
            
            for (int c : cur) {
                next.add(c | num);
            }
            
            res.addAll(next);
            cur = next;
        }
        
        return res.size();
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2505 (Bitwise OR of All Subsequence Sums)?

This page provides optimized solutions for LeetCode problem 2505 (Bitwise OR of All Subsequence Sums) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2505 (Bitwise OR of All Subsequence Sums)?

The time complexity for LeetCode 2505 (Bitwise OR of All Subsequence Sums) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2505 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2505 in Java, C++, or Python.

Back to LeetCode Solutions