Before you go on, please make sure you have read Part 1.
Great! Let’s talk about the next usecase.
Problem
Given an array of integers, find the maximum xor subarray. Or simply,Given a1, a2, ....., an, find i and j , i <= j, such that ai xor ai+1 xor ...
