hardArrayBit ManipulationDynamic Programming 0 views
Find the Maximum Sequence Value of Array
You are given an integer array nums and a positive integer k.
You are given an integer array nums and a positive integer k.
The value of a sequence seq of size 2 * x is defined as:
Return the maximum value of any subsequence of nums having size 2 * k.
Example 1
Input: nums = [2,6,7], k = 1
Output: 5
Explanation: The subsequence [2, 7] has the maximum value of 2 XOR 7 = 5 .
Example 2
Input: nums = [4,2,5,6,7], k = 2
Output: 2
Explanation: The subsequence [4, 5, 6, 7] has the maximum value of (4 OR 5) XOR (6 OR 7) = 2 .
Constraints
- 2 <= nums.length <= 400
- 1 <= nums[i] < 27
- 1 <= k <= nums.length / 2
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.