Here's the link to the question, this has a time limit of 2.5 seconds, we're supposed to eliminate the subarrays which have it's xor sum as a perfect square. I'm pre-computing all the perfect squares till 1e6(because maximum xor sum cannot exceed that) and hence eliminating all such subarrays whose xor sum is an element in the perfect square array, not greater than 2*n. But it's throwing a tle. Could someone please point out what i'm doing wrong. Thank You Very Much!!! (187177527)