For 768C - Jon Snow and his Favourite Number , what is the intuition to solve it ? At first for small constraint I made brute force solution and noticed that there is a pattern , there can be two different arrays — when k is even and when k is odd.
But this is not working . Here is my code .
There is a pattern, the arrays repeat themselves after some amount of iterations. Those iterations are not dependent on k though.