FastPrep
Problem · Bit Manipulation

Maximum XOR Suffix

Learn this problem
● MediumTiktokNEW GRADINTERNOA
See Tiktok hiring insights

Problem statement

An array of n integers, arr, is given. Pick any index then calculate the XOR of the array from that index through the highest index. Append the value to the array. Repeat this process zero or more times. Determine the highest value possible.

Function

maximumValue(arr: int[]) → int

Complete the function maximumValue in the editor below.

maximumValue has the following parameter:

  1. int arr[n]: the starting array

Returns

int: the maximum possible value in the array

Examples

Example 1

arr = [8, 2, 4, 12, 1]return = 14
Example 1 illustration
Explantion is shwon in the image above pint 👆👆 The max strength possible is 14.

Example 2

arr = [1, 2, 3]return = 3
Regardless of what index is chosen, the XOR value can never be greater than 3 :)

Constraints

  • 1 ≤ n ≤ 105
  • 0 ≤ arr[i] < 230

    • More Tiktok problems

    drafts saved locally
    public int maximumValue(int[] arr) {
  // write your code here
}
    arr[8, 2, 4, 12, 1]
    expected14
    checking account