Leetcode 2505. Bitwise OR of All Subsequence Sums

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.