As we know if we have an array of size n, let's say a0, a1, a2, ......, an-1.↵
we can preform x**x** move clockwise with **((ai + x) % n)** and anticlockwise with **((ai —— x) % n + n) % n.**↵
↵
Can we generalized for clockwise and anticlockwise for the index **i to j?** *(i >=0 & i < n)*? ↵
↵
So what will be the formula if we want to move **x** *(x can be greater than (j — i + 1))* steps in a circle from **ai to aj** *(i >=0 & i < n)* in an array *(0 indexed and size of the array is n)?*?↵
↵
Any help will be appreciated.
↵
Can we generalized for clockwise and anticlockwise for the index **i to j
↵
So what will be the formula if we want to move **x** *(x can be greater than (j — i + 1))* steps in a circle from **ai to aj** *(i >=0 & i < n)* in an array *(0 indexed and size of the array is n)
↵
Any help will be appreciated.
