Maximum XOR Subset

Problem

Given a set of positive integers. The task is to complete the function maxSubarrayXOR which returns an integer denoting the maximum XOR subset value in the given set.

Solution - here

Complexity - O(N)

Code - here

Similar problem - Maximum XOR subarray using TRIES