Available question text
Given an integer array, compute the bitwise OR of the sums of every possible subsequence. The challenge is to decide which bit positions can appear in some subset sum—taking carries across bits into account—efficiently without enumerating 2^n subsets, using bitwise/greedy or knapsack-like reasoning.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2505. Bitwise OR of All Subsequence Sums
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source