Available question text
Pick a subsequence of length 2k (preserving order) and split it into the first k and last k elements to maximize (OR of the first half) XOR (OR of the second half). With n ≤ 400 and nums < 2^7, the problem is a bitwise/DP optimization over OR states.
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 3287. Find the Maximum Sequence Value of Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source