maximum-subarray-xor-with-bounded-range

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given a non-negative integer array <code>nums</code> and an integer <code>k</code>.

You must select a subarray of <code>nums</code> such that the difference between its maximum and minimum elements is at most <code>k</code>. The value of this subarray is the bitwise XOR of all elements in the subarray.

Return an integer denoting the maximum possible value of the selected subarray.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [5,4,5,6], k = 2

Output: 7

Explanation:

<ul>
	<li>Select the subarray <code>[5, 4, 5, 6]</code>.</li>
	<li>The difference between its maximum and minimum elements is <code>6 - 4 = 2 &lt;= k</code>.</li>
	<li>The value is <code>4 XOR 5 XOR 6 = 7</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: nums = [5,4,5,6], k = 1

Output: 6

Explanation:

<ul>
	<li>Select the subarray <code>[5, 4, 5, 6]</code>.</li>
	<li>The difference between its maximum and minimum elements is <code>6 - 6 = 0 &lt;= k</code>.</li>
	<li>The value is 6.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 4 * 104</code></li>
	<li><code>0 &lt;= nums[i] &lt; 215</code></li>
	<li><code>0 &lt;= k &lt; 215</code></li>
</ul>