Given an binary string 100000... of size '$$$m$$$' on day 0 , For each subsequent day, the updated value at each index >= 1 is given by xor of the value of (i-1)th index and ith index on the previous day . Print the binary string on nth day . where $$$1<=n,m<=1e5$$$ .
I am able to see some pattern after writing down the string for several days but not able to make it concise .
Edit : Following is the link
Read the first question of coding round.
question is slightly different from the link given (since that question can be solved by brute force)
I asked this question and my contribution went from 0 to -15 . I agree that i am not helping someone but i thought people might find this problem interesting and i can get help . Also i tried for few hours before posting . Even small help from your side will motivate me to grow and work harder .
So many nice ideas provided . I want every one in comment section THANK YOU for helping !