mamba7's blog

By mamba7, history, 16 months ago, In English

In a recent hiring challenge, a question was asked to find the no. of arrays of size N, whose xor of all the elements is 0 and the array should only contain 0,1,2,3,4,5 as its element. Return ans%(1e9+7). 1<=N<=1e5

Here are the test cases for the first 60 elements.

How should I approach this problem?

Read more »

  • Vote: I like it
  • -3
  • Vote: I do not like it