You are viewing a single comment's thread. Return to all comments →
Can you please also tell me the logic of right rotation .
Here is the answer for right rotation:
def rightRot(a,d): return a[d+1:]+a[:d+1]
can you explain this please
This is my code and it passes all the test cases.
using namespace std;
int main() { int n,d; int a[n]; for(int m=0;m>a[m]; } cin>>d; for(int i=1;i<=d;i++) { int k=0; for(int j=1;j
return 0; }
Arrays: Left Rotation
You are viewing a single comment's thread. Return to all comments →
Can you please also tell me the logic of right rotation .
Here is the answer for right rotation:
can you explain this please
This is my code and it passes all the test cases.
include
using namespace std;
int main() { int n,d; int a[n]; for(int m=0;m>a[m]; } cin>>d; for(int i=1;i<=d;i++) { int k=0; for(int j=1;j
return 0; }