How should I practice Maximum XOR Suffix?

Start by reading the full statement, solve the visible examples, then compare the pattern against related TikTok online assessment problems in FastPrep.

Is Maximum XOR Suffix associated with TikTok?

FastPrep tags this as a TikTok online assessment coding practice problem when the problem catalog has that company and stage context.

Maximum XOR Suffix

TikTok● MediumNEW GRADINTERNOA

Learn

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:

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

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 ≤ 10⁵
0 ≤ arr[i] < 2³⁰