You are given an integer array nums and a positive integer k.

The sequence value of a subsequence of length $2 \cdot k$ is calculated by:

1. Finding the bitwise OR of its first $k$ elements.

2. Finding the bitwise OR of its remaining $k$ elements.

3. Taking the bitwise XOR of the two resulting values.

Return the maximum possible sequence value achievable from any subsequence of nums having length $2 \cdot k$.

Constraints:

• $2 \leq$ nums.length $\leq 400$

• $1 \leq$ nums[i] $< 2^7$

• $1 \leq$ k $\leq$ nums.length $/ 2$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.