- Practice
- Data Structures
- Arrays
- Left Rotation
- Discussions

# Left Rotation

# Left Rotation

akueisara39 + 83 comments This is my solution in Java

`public class Solution { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int d = scan.nextInt(); int[] array = new int[n]; for(int i=0; i<n;i++) { array[(i+n-d)%n] = scan.nextInt(); } for(int i=0; i<n;i++) { System.out.print(array[i] + " "); } } }`

ramkr7 + 1 comment can i get an explanation,pls?

akueisara39 + 16 comments Each time I read an element of the array from the input, I directly assign it to the array at the speific index after shifting. d left rotations equal (n-d) right rotations. The array has a size of n, so when the index (i+n-d) is equal to n, the index actually goes back to the starting index. I use mod to get the correct index where I want to assign the element when the index is larger than n. I'm not an english native speaker. Hope you will understand what I explain. :)

motox2 + 1 comment I see a problem here. You've assumed that we can sort the array at the time of initialization itself. Though it's good, but IMHO, the real test is to sort an already existing array with space constraints.

qianyaonan + 15 comments Good thinking! I guess it could be handled with another array logically. My two cents.

`...... int[] getArray = new int[n]; for (int i = 0; i < n; i++) { getArray[i] = scan.next(); } for (int i = 0; i < n; i++) { array[(i + n - d) % n] = getArray [i]; } for(int i = 0; i < n; i++) { System.out.print(array[i] + " "); }`

suulisindiyaka + 2 comments I like you code some much.PLEASE can you add some explainatioin.I will be very glad

qianyaonan + 1 comment It just generates an array first from Stdin, then illustrates the way to left-rotate an EXISTING array.

vamphonephong + 0 comments I'm failing to see where it actually does a left rotate of an existing array.

What I'm seeing is (from assumption of ...) array[0..n] is empty initially. getArray[0..n] stores input from stdin. store rotated result into array[0..n].

The existing array is getArray. That array is still in an unrotated order. The array[0..n] isn't considered the exiting array as it is empty.

Challenge to you: get rid of getArray array and store input into array[] array. Rotate that array and then print the end result of that array.

jeffreyzhuu + 2 comments This code is actually quite efficient. So for the following values, n=5 (number of elements in the array), d=2 (number of rotations)and assuming i goes from 0-4. (i + n - d)%n with the iteration of i from 0-4: (0+5-2)%5=3 (1+5-2)%5=4 . . . (4+5-2)%5=2 So essentially, you are changing the locations of the elements in the array. How the "%" works is that it takes the remainder. So for example, 1%7=1 since 1 cannot be divided by 7 which means 1 is the remainder.

nunziomeli5 + 2 comments That's not the aim of the exercise... You have to fill the array and after shift!!! In this way is easy and you are not resolving the left shift problem.

akueisara39 + 5 comments For me, it's just an alternative way. There's not only one way to think for the same problem whatever the solution is good or bad. I shared my solution because I hadn't seen anyone think the same way and I thought it was good to learn from people's comments on my solution.

shankar455161 + 0 comments A good solution by you!

ekimalc + 0 comments I like your solution, elegant and efficient. It took my two days for mine and even now has timeout issues when testing. I have good envy now. Well done!

govind_yadav_141 + 1 comment I really like your solution as you have reduce the time complexity to O(n^2) while is very efficeint compare to my program which has a T(n) = O(n^3)

Sufiyan + 0 comments How the complexity is quadratic? It is O(n), right?

skandy + 1 comment This solution will not work when rotation is greater than array size, meaning d > n. Java returns negative result if you perform % operation on a negative number. And that negative number will throw an

java.lang.ArrayIndexOutOfBoundsException

Eg. n = 4, d = 7

Starting with i=0, a[(i+n-d)%n] will give a[(0 + 4 - 7)%4] => a[(0 + (-3))%4] => a[(-3)%4] => a[-3]

Range of a is from 0 to n. Hence the error

ravievolution87 + 0 comments for this case you can check for d>n and d = d%n then d will be in range of 0 to n and the above solution will work perfectly :)

ravilog91 + 0 comments this is the simplest and most efficient solution. I was struggling Time out error with mine.

[deleted] + 2 comments It's the far superior solution. Why shift all the elements in the array individually, when you can just shift the index to achieve the same result? It's a total waste of processing to shift the entire array. What if the array was 1,000,000,000 elements long, and you had to shift multiple times? In an interview they would probably expect you to do it this way, with an explanation of your logic.

Wafflenaut + 0 comments I agree. If they wanted something to shift elements of an array, they should have asked for a function to do so.

eniv230862 + 0 comments In my case, they were expecting the function that returns a vector with all the elements rotated any number of times. So, the best way is to take the number of shiftings and move the index that number of times, and do the shift only one time.

tanp1 + 0 comments Have you tried running this? You actually run into an issue where you just propagate the first value in the array across all other indices in the array using your method.

The second for loop moves the value at index 0, the 1, over to index 1, overwriting the value 2 at index 1, and then this 1 gets written into all the other indices as a result.

tp2124 + 3 comments Solid answer. I would like to point out to people that this does require double the memory of the intial answer as this requires a second array to store all the properly ordered array. If you're on a memory tight situation, this would not be a favorable solution.

corey_t_ferguson + 4 comments To solve this, I've shifted the elements in the array in O(n) time and O(n) memory (vs O(2n)). Not as easy on the eyes, though :(

function processData(input) { // get `n` and `d` from input const lines = input.split('\n'); const firstLine = lines[0].split(' ').map(Number); const n = firstLine[0]; const d = firstLine[1]; // process each line lines.slice(1, lines.length).forEach(line => { // no need to shift in these cases if (n === 1 || d === n) { console.info(line); } else { // shift digits const a = line.split(' ').map(Number); let lastLastItem = null; let count = 0; let i = 0; while (count < n) { i++; const start = i; let j = start; do { count++; let lastItem = lastLastItem; lastLastItem = a[j]; a[j] = lastItem; j = shiftLeft(n, d, j); } while (j !== start); a[start] = lastLastItem; } console.info(a.reduce((acc, value) => { return acc+' '+value; })); } }); } /** * @param {Number} n total number of elements * @param {Number} d number of shifts to left * @param {Number} i index to begin shifting from * @returns {Number} new index after shifting to left */ function shiftLeft(n, d, i) { return (n-d+i)%n; }

I'm ignoring the processing time on input string manipulation and such. This examples assumes they gave us an existing array to manipulate.

vjindal23 + 0 comments Hey! Could you include comments in your code please? I use C and dont kow other language as of now but would like to learn from your solution O(n) is preety nice

siregar_jaswir + 1 comment i think your solutions is O(n^2) for the worst case.

corey_t_ferguson + 0 comments It looks like it, because of the nested loops. But it'll break out of all loops after

`n`

loops.

gauravsxr2000 + 1 comment [deleted]gauravsxr2000 + 2 comments Hey could you help me confirm if the time complexity of my code is a constant?

n, r = map(int, input().split()) a = list(map(int, input().split())) slice1 = a[:r] slice2 = a[r:] a = slice2 + slice1 print(*a)

adityarajedevad1 + 0 comments [deleted]aditya_mahimkar + 0 comments As all line are executed once the time complexity is constant O(1).

sslucky8044 + 0 comments Solution.cpp:1:1: error: ‘function’ does not name a type; did you mean ‘union’? function processData(input) { ^~~~~~~~ union Solution.cpp:45:1: error: ‘function’ does not name a type; did you mean ‘union’? function shiftLeft(n, d, i) { ^~~~~~~~ union

corey_t_ferguson + 0 comments Revisited this with an easier-on-the-eyes solution that finishes in O(n) time with O(n) memory.

function main() { // ... loopUntilAllSwapped(a, d); console.log(a.join(' ') + '\n'); } /** * If a.length can be divided by d evenly, swapSeries will end * where it started without swapping all numbers. * This function ensures that all numbers are swapped. * * Variables: * a: array of numbers * d: number of left-rotations to perform * c: count of numbers swapped * i: index to start swapSeries() from */ function loopUntilAllSwapped(a, d) { let c = 0; let i = 0; while (c < a.length) { c += swapSeries(a, i, d); i++; } } /** * Swaps elements in an array in-place. * * Variables: * a: array of numbers * i: index to start with * d: number of left-rotations to perform * c: count of numbers swapped, returned to loopUntilAllSwapped() * iS: index source (index of number to be moved) * iD: index destination (index iS will be moved to) * q: a queue that acts as a temporary buffer for numbers as they * move from source to destination * * Algorithm: * 1. Find index destination (iD) of a[iS] after d rotations to * left * 2. Place destination in temporary buffer (q). * 3. Replace destination with index source (iS) value (a[iS]). * 4. Repeat until we end where we started (iS === i) */ function swapSeries(a, i, d) { let c=0; let iS = i; let q = [a[iS]]; do { let iD = h(a.length, d, iS); q.push(a[iD]); a[iD] = q.shift(); iS = iD; c++; } while (iS !== i); return c; } /** * A constant-time formula to find index destination of i * after d rotations to left. */ function h(n, d, i) { return ((n-d%n)%n+i)%n; }

CS234_1716410234 + 1 comment YOU don't need second vector for this. Just store the 0th index of a vector in some temp variable and when the whole array gets shifted by one left rotation ,store it at the n-1th index. Repeat the process till d becomes zero.

rashtarsandhu + 0 comments I did this with python but they are saying try a more optimized solution

iam_ghanshyam + 0 comments In my opinion, the 3rd for-loop is unnecessary.. Instead it should be merged with the 2nd one.

alxsm + 0 comments [deleted]liuch_sdu + 0 comments This should be called circle array,haha

tomisin + 0 comments Doesn't this use extra space?

wyrlvillazorda + 1 comment for me is: (d + i) % n

15euec173 + 1 comment what does it mean...????

15euec173 + 1 comment %.....?

ramishsaqib + 0 comments It means to divide the numbers and return the remainder

ajinkya_ghonge + 0 comments One drawback i can see here is that you are actually holding the IO operation while your code is getting executed. This will not affect for an input of 100, but think about an input of millions

karhik110 + 0 comments nice!! different way of thinking! you cahnged the way of thinging..

pmahanth967 + 0 comments getArray[i] = scan.next(); this is an error.It cannot be converted into string.

getArray[i] = scan.nextInt(); this is correct statement.

raju_muke + 0 comments Hey @qianyonan

You have forgot to initialize the empty array i.e. array variable .

that's why little bit hard to understand to newbie.

One more thing , Don't you think you are using extra space bcz you can solve this problem using existing array too.

GodsonLG + 0 comments using 2 arrays?

2018_ravi_mudal1 + 0 comments space complexity is O(n)

justin_gries + 0 comments Very nice. I didn't even think to assign the integers to their "new" positions in the array as they are read in.

anandki + 0 comments Concise code and Wonderful explanation.This should go to Editorial.

Purushotam_ + 0 comments why can't we do the left rotation. like you said d left rotation is equal to n-d right rotation.what is problem in that...

Infinity_Coder + 0 comments Given an array of n integers and a number, d, perform d left rotations on the array. So this means that the array is already given. Then we have to perform left rotation on that. Your solution may produce the required results, but as others have pointed out, I think that is not what has been asked in the solution. We have been given a complete array, and on that we have to perform the rotation.

nelpontejos + 0 comments thanks

sriram_pant5 + 0 comments very convenient solution

vedang_bhardwaj1 + 0 comments pretty rad :),loved it.

chen081501 + 0 comments Thanks a lot ! Really helpful !

the_back_bencher + 0 comments Wow probably the best solution of this question...Thanks a lot :)

emalnawabi1 + 0 comments thanks so much for your great logic

kavaansh157 + 0 comments thank you so much.... The approach was great.

parthshah590 + 0 comments Thanks

ankitshuklatiwa1 + 0 comments Brilliant..Simply Brilliant

chgopal0496 + 0 comments This is great.

akimran3 + 1 comment your code is very small and still work fine, will you explain me how [(i+n-d)%n] is working here. please actually why you are using % here thats making me confuse

ramkr7 + 1 comment % (modulus) gives you the remainder of division.so 4%5=4,5%5=0 likewise 6%5=1, it helps you to stay inside the limit i.e lesser than the value n (i.e till n-1) eg:if n=5 it goes from 0 to 4.try this simple mod in calc or put it in a loop you will understand.we are getting the input value to the rotated index thats why (-d).if right rotation +d.

alex_k_stamatis + 0 comments It's a great solution but how would someone come up with the idea to use a modulus in this case?

ajaycarnet + 7 comments This is my C# sharp code.

`string[] s1 = Console.ReadLine().Split(' '); int n = int.Parse(s1[0]); int k = int.Parse(s1[1]); string[] s = Console.ReadLine().Split(' '); int[] array = new int[n]; ////pre-rotation of array method: //-----------------------------------Right rotation //for (int i = 0; i < n; i++) //{ // array[(i + k) % n] = int.Parse(s[i]); //} //------------------------------------Left rotation for (int i = 0; i < n; i++) { array[(i + (n-k)) % n] = int.Parse(s[i]); } for (int i = 0; i < n; i++) { Console.WriteLine(array[i]+" "); }`

axaysd + 0 comments THANK YOU SO MUCH FOR THIS SOLUTION!!!!!!!!!!!!!!!!!!!! :')

I've been searching for both right & left shift formulae!!!

jdnark + 0 comments This code will fail the test. This is the fix:

for (int i = 0; i < n; i++) { Console.Write(array[i]+" "); }

Console.WriteLine();

ermaneesh007 + 1 comment Very slow. & it will not work out 1,000,000,000 records

aayush_break + 0 comments exactly...it's better to follow up with "Reversal algorithm". Follows O(n) time complexity without the usage of any temp storage. Hence saves storage and time both

Pree92tham + 0 comments Not the desired approach but it gets the job done though

static void Main(String[] args) { string[] token=Console.ReadLine().Split(' '); int n=Convert.ToInt32(token[0]); int k=Convert.ToInt32(token[1]); string[] arr1=Console.ReadLine().Split(' '); int [] arr=Array.ConvertAll(arr1,int.Parse);

`int temp=0; Queue<int> l=new Queue<int>(); for(int i=0;i<n;i++){ l.Enqueue(arr[i]); } for(int j=0;j<k;j++){ temp=l.Dequeue(); l.Enqueue(temp); } foreach(int i in l){ Console.Write("{0} ",i); } }`

nicholas_mahbou1 + 0 comments Great solution ajaycarnet. I compared yours with my own and yours is much faster.

var sw = Stopwatch.StartNew(); int[] array = new int[n]; for(int i = 0; i < n; i++) array[(i + (n - d)) % n] = int.Parse(s[i]); sw.Stop(); for(int i = 0; i < n; i++) Console.Write(array[i] + " "); Console.WriteLine(); Console.WriteLine(sw.ElapsedTicks); // 5 ticks sw = Stopwatch.StartNew(); int[] a1 = Array.ConvertAll(s, Int32.Parse); int[] buffer = new int[d]; Array.Copy(a1, 0, buffer, 0, d); Array.Copy(a1, d, a1, 0, a1.Length - d); Array.Copy(buffer, 0, a1, a1.Length - d, d); sw.Stop(); foreach(var num in a1) Console.Write(num + " "); Console.WriteLine(); Console.WriteLine(sw.ElapsedTicks); // 700+ ticks

indyHarcourt + 0 comments My C# code:

var inString = Console.ReadLine().Split(' '); var size = int.Parse(inString[0]); int d = int.Parse(inString[1]); var inString_temp = Console.ReadLine().Split(' '); List<int> seq = Array.ConvertAll(inString_temp,Int32.Parse).ToList(); int pointer; for (pointer = d; pointer < seq.Count; pointer++) { Console.Write($"{seq[pointer]} "); } for (pointer = 0; pointer < d; pointer++) { Console.Write($"{seq[pointer]} "); }

yalcinberkay + 0 comments I have submit my code but last two case didnt pass because of execution time.I couldnt think assign variable before calling the method.Thank you

h276692580 + 5 comments Did anyone consider if we cant alloc a new array to store sorted array, only operate the old array to left rotation?

justin_gries + 0 comments At the very least, you would have to allocate memory to store one integer. The question then becomes what you consider to be important: memory, or run-time, or something in between. If your primary focus is memory, then your solution is just to move EVERYTHING in the array one unit over, multiplied by the number of iterations. (You can mitigate this somewhat by right-shifting if the number of iterations is more than 1/2 the size of the array.) If your focus is time, then just transfer everything to another array, and back again, giving ~ O(2n). A decent in-between (which is what I went with) is to move only the number of elements out that you need to move (max 1/2 n) to another array, shift everything else, then re-insert the moved elements.

ivan_rrr + 0 comments It is not the best solution but it requires only one array:

static void Main(String[] args) { string[] read = Console.ReadLine().Split(' '); int n = int.Parse(read[0]); int d = int.Parse(read[1]); int[] array = new int[n]; array = Array.ConvertAll(Console.ReadLine().Split(' '), Int32.Parse); for(int q=0;q<d;q++) for(int i=0;i<n-1;i++) { swap(array, i,i+1); } for(int y=0;y<n;y++) Console.Write(array[y] + " "); Console.WriteLine(); } static void swap(int[] input, int indexA, int indexB) { int tmpA = input[indexA]; int tmpB = input[indexB]; input[indexA] = tmpB; input[indexB] = tmpA; }

carlostse + 0 comments Yes. But I think it will slower than

int *swp = new int[n]; memcpy(swp, (const void *)(arr + d), (n - d) * sizeof(int)); memcpy(swp + (n - d), (const void *)arr, d * sizeof(int));

Correct me if I am wrong.

nintendroid + 0 comments [deleted]nintendroid + 1 comment My in-place O(n) solution. No allocation required

template <typename Iterator> static void rotate_left(Iterator begin, Iterator mid, Iterator end) { while (begin != mid && mid != end) { auto it = mid; while (begin != mid && it != end) { std::swap(*begin++, *it++); } if (begin == mid) { mid = it; } } } int main() { int n{}; int k{}; std::cin >> n >> k; std::vector<int> values(n); std::copy_n(std::istream_iterator<int>(std::cin), n, values.begin()); auto mid = values.begin(); std::advance(mid, k); ::rotate_left(values.begin(), mid, values.end()); std::copy(values.begin(), values.end(), std::ostream_iterator<int>(std::cout, " ")); return 0; }

ArshadAQ + 0 comments Why has everyone ignored this?

ihateyou + 2 comments Is it possible to do the same in C# using only one array (as one array must hold the splitted values and other to place them accordingly) ?

ivan_rrr + 0 comments It is not the best solution but it requires only one array:

static void Main(String[] args) { string[] read = Console.ReadLine().Split(' '); int n = int.Parse(read[0]); int d = int.Parse(read[1]); int[] array = new int[n]; array = Array.ConvertAll(Console.ReadLine().Split(' '), Int32.Parse); for(int q=0;q<d;q++) for(int i=0;i<n-1;i++) { swap(array, i,i+1); } for(int y=0;y<n;y++) Console.Write(array[y] + " "); Console.WriteLine(); } static void swap(int[] input, int indexA, int indexB) { int tmpA = input[indexA]; int tmpB = input[indexB]; input[indexA] = tmpB; input[indexB] = tmpA; }

timm_mason + 1 comment This does the rotation in place. 1 line solution.

for (int i = d; i < d + n; i++) Console.Write($"{a[i%n]} ");

mikesmithwick + 0 comments The writeup specified that the output was to be printed the array reflecting the rotation. Nothing about having to actually create a rotated array and dump it to the console. And considering the submitter never supplied a stub to the actual rotation routine specifying the return as being an array, this is a legitmate answer. Likely not the one the OP intended.

If I were to give a coding test to someone I'd toss them something like this. Likely they'd code out a fancy in-place algorithm, in which I would warn them that they were over-engineering the solution for the specified output.

a646608986 + 0 comments 厉害，佩服

whoiscris + 0 comments Thumbs up, for sharp thinking. Complicated my solution before stumbling on the same short solution myself :D

vamphonephong + 0 comments "A left rotation operation on an array of size n shifts each of the array's elements d unit to the left."

This isn't a correct solution. It's merely masking itself to be a solution. It's taking input and stuffing it pre-ordered into a new array. You should be doing a left rotation on an existing array.

hhariyale + 1 comment move that n-d outside the loop its always same. other then that your solution is best.

jdnark + 0 comments Not sure what the n-d is to move outside the loop. Thanks for the feedback.

I'm trying to figure the site out to do a test for employment. I keep getting time out so I have been experimenting to see what is causing the times outs. I don't want to fail an employment related challenge b/c of a site timeout.

I find I have to write code that is less and less readable to try and get around the timeout issues.

navrattanocp + 2 comments your time complexity : O(n + n) your space complexity : n

you can optimize it a little bit with :

time complexity : n + d space complexity : d

public static void main(String[] args) { Scanner c = new Scanner(System.in); int n = c.nextInt(); int d = c.nextInt(); int skipPart[] = new int[d]; int j =0; for(int i = 0; i < n; i++) { if(i >= d) { System.out.print(c.nextInt() + " "); } else { skipPart[j] = c.nextInt(); j++; } } for(int i = 0; i < skipPart.length; i++) { System.out.print(skipPart[i] + " "); } }

jdnark + 0 comments Got it. I'm guessing being judged in a challenge your way of thinking is better -- do the challenge int he fewest steps possible. I really do not think of optimzing the stdin/stdout as they are just mechanism for giving you the data needed and demonstrating the algorithm is correct. I'm guessing if company is viewing my code, they will think with your mindset.

vamphonephong + 2 comments There are a lot of people solving the problem this way. Reread the problem statement and you'll see that this doesn't do what was asked. There only prints out the input in the order expected after a left rotation d times. The real problem is left rotating an existing array and then print the final content of the array. So what you need to do is read in your input and then store it into an unsorted, unrotated, etc array. Left shift that array, and then print it out from array[0] to array [n].

navrattanocp + 0 comments thanks. Got it.

lilbyrdie + 0 comments That's what I was thinking, too. The easiest solution to the

*expected output*isn't necessarily solving the stated problem. But, that's also the nature of the problems. Perhaps a better problem would be one that simply passed in an array and you had to modify said array in place. That would at least ensure the right problem is being solved.

bonin_maxime + 0 comments I like this I wish I'd came to this algorithm myself ...

lewap_ruzam + 1 comment Similarly:

public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int d = sc.nextInt(); int array[] = new int[n]; for (int i=0; i<n; i++) { array[i] = sc.nextInt(); } for (int i=0; i<n; i++) { System.out.print(array[(i+d)%n] + " "); } }

aabhasr1 + 0 comments A really good solution. I was unable to figure it out mathematically XD.

camkida + 0 comments very clever, thanks!

unzain + 0 comments What a great hack, akueisara39! Given that the defaulted code that read the elements into an array, I saw myself forced to use additional space.

callmeyesh1 + 0 comments Can someone explain how you came about the formula (i+n-d)? I am not able to understand how that formula is derived?

werner + 0 comments good logic akueisara. i used similar logic like "(i+n-d)%n" in circular linked list.

cayhan + 0 comments it is just awesome. I want to ask how you think this way, while everybody else is concentrating on different point, your solution is really different and cool :) My understanding is you approach the problem right at the beginning, the only issue is the coming up with this formula "(i+n-d)%n" good thinking akueisara39

ademar111190 + 0 comments It is a greate solution.

I think something similar, but your solution is better.

Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int d = scanner.nextInt() % n; int arr[] = new int[n]; for (int i = 0; i < n; i++) { arr[i] = scanner.nextInt(); } scanner.close(); for (int i = d; i < n; i++) { System.out.print(arr[i]); System.out.print(' '); } for (int i = 0; i < d; i++) { System.out.print(arr[i]); System.out.print(' '); } System.out.println();

AmandeepSaxena + 4 comments int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */ int i,d,k,n,temp,j; cin>>n; int a[n]; for(i=0;i<n;i++) cin>>a[i]; cin>>d; for(i=0;i<n;i++) cout<<" "<<a[(i + (n - d)) % n]; return 0; }

pls let me knw wats wrng in this?

dexter97 + 0 comments [deleted]Mikeiyan + 0 comments cin >> d; should be after cin >> n;

rajatddjsehgal + 1 comment you need to use vector instead of array for memory allocation at runtime else if you are using array they you have to use dynamic array.

saishashank65 + 0 comments vector leftRotation(vector a, int d) { int temp; for(int j=0;j

//whats wrong one test case not working(timeout error)

shivamrajawat + 0 comments write a[(i+d)%n] in place of a[(i + (n - d)) % n]

Wafflenaut + 3 comments My C solution was similar:

int main() { int n; int d; int temp; int *array = (int *)malloc(sizeof(int) * n); scanf("%d", &n); scanf("%d", &d); for(int i = 0; i < n; i++){ temp = i - d; if(temp < 0){ temp = temp + n; } scanf("%d", &array[temp]); } for(int i = 0; i < n; i++){ printf("%d ", array[i]); } return 0; }

[DELETED] + 1 comment [deleted]duc5121991 + 0 comments [deleted]

duc5121991 + 0 comments Hand down! Best solution for me!

yash_behara + 0 comments Nailed it!

david_varela + 1 comment It can be optimized in terms of space if you don't store the whole array, but only the rotated elements. If the elements are 1 2 3 ... 100000, and the number of left rotations is 2, you can save the first two elements (1 and 2) and directly print the rest as soon as you read them. Finally, print the saved ones. The difference in space is from 100000 ints to 2 ints.

AmandeepSaxena + 1 comment what if I have thousand rotation??then I have to store thousands of int?

david_varela + 1 comment no no, if you have 1000 rotations in an array of 30, you have 1000/30 complete rotations (rotations of the whole array) and 1000%30 effective left rotations. So you store only the first 1000%30 elements. Sorry for the initial incomplete explanation, my fault.

AmandeepSaxena + 1 comment appreciated!!bt still don't you think it will require alot memory??even if u will use 1000%30

AmandeepSaxena + 0 comments I think on the place to store those elements it will b more efficient to jst show those elements.

alammdtalib + 0 comments How come you reached to this logic array[(i+n-d)%n], i understood what you did here but, having hard time to understand how did you get to this formula, does it comes with expreince or some mathematical practice i am lacking. Thanks

akotkarniranjan3 + 0 comments Pure Magic !!!

dexter97 + 0 comments [deleted]dexter97 + 0 comments [deleted]Arpit682 + 0 comments The logic does it in one loop. Brilliant.

mgwatt0521 + 0 comments Very creative solution!

justinimran1994 + 0 comments 3 errors is generating

justinimran1994 + 1 comment public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int d = in.nextInt(); int[] array = new int[n]; int c=0,i,temp; for(i=0; i

`temp=array[0]; for(i=0; i<n;i++) { array[i]=array[i+1]; } array[n]=temp; c++; for(i=0; i<n;i++) { System.out.print(array[i]); } }`

} }

iit2015046 + 0 comments I used the same logic but timeout error is coming for the last case.

sksunilkumar107 + 0 comments what is the issue if i write this way.

gunakk777 + 0 comments Awesome , this really saves time .Thank You..!!

ishabandi + 0 comments I was thining on the same lines after I got the timeout error. But didn't reach anywhere, I was still using the same number of For loops some how! Thanks a lot!

quint + 0 comments [deleted]SmrutiBarik + 0 comments So without using an extra array u did it. Basically u dont have an input array.. Great

Coding_Karma + 0 comments is the array[(i+n-d)%n] is some standard algo?

ssuryawanshi940 + 0 comments suppose if i enter value of n=5;d=2; then it will accept five numbers not more than that but if i wil not hit the Enter key then it will have been accepting the many values i will hav to take only 5 values not more than that

seek23u + 0 comments Awesome...

abhiram_n + 0 comments amazing!!

fmcnish + 0 comments ¿This works for you? In my analysis, this does a right rotation instead of a left rotation. Isn't it? You should implement the logic for translate right to left rotations or to invert the direction.

mouli_3022 + 0 comments Nice

olegcherednik + 1 comment static int[] leftRotation(int[] a, int d) { for (int i = 0, j = a.length - 1; i < j; i++, j--) swap(a, i, j); d %= a.length; if (d > 0) { d = a.length - d; for (int i = 0, j = d - 1; i < j; i++, j--) swap(a, i, j); for (int i = d, j = a.length - 1; i < j; i++, j--) swap(a, i, j); } return a; } private static void swap(int[] arr, int i, int j) { int tmp = arr[i]; arr[i] = arr[j]; arr[j] = tmp; }

ajgill + 0 comments [deleted]

markphan2012 + 0 comments Hi akueisara39 : i appreciate your code as it appears to be out of box solution . but i feel it throws an exception when the number of shift operations is greater than the size(d>n) of the array so just added few lines of code to it .

int[] array = new int[n]; if(d>n) d=d%n; for(int i=0; i array[(i+n-d)%n] = scan.nextInt();

}maitrey2112 + 2 comments Instead of rotating each element we can just cut the string upto that index and paste(append) it at the end of the string.

A solution for python would be

def leftrotation(a,d): return(a[d:]+a[:d])

matant + 0 comments beautiful solution!!!

parthkapil97 + 3 comments but this will not work when d > len(a)

fezett + 0 comments true, but the constraints say 1 <= d <= n :)

mpranay2017 + 0 comments It will not work it if it is d > = len(a)

niksw7 + 0 comments Here's my solution in Kotlin. I did it using circular LinkedList. data class Node(val value: Int, var nextNode: Node?)

fun main(args: Array) { val (n, d) = readLine()!!.split(" ").map(String::toInt) val list = readLine()!!.split(" ").map(String::toInt) var head = Node(list[0], null) var current = head var rotatedHead = head for (i in 1 until n) { val node = Node(list[i], null) current.nextNode = node current = node if (i == d % n) rotatedHead = node } current.nextNode = head

`current = rotatedHead repeat(n) { print(current.value.toString() + " ") current = current.nextNode!! }`

}

eaperezc + 0 comments genius!

anshul_sachdeva + 0 comments I liked your approach.But I would like to pin point one thing here as you have been already given an array and N number of rotation.ON that array you have to perform operations.You are changing it while reading from console. please have a look at this and let me know if this can be optimized.

static int[] leftRotation(int[] a, int d) { // Complete this function

`int[] b= new int[a.length]; for(int iLoop=0;iLoop<a.length;iLoop++){ b[iLoop]=a[iLoop]; } for(int iLoop=0;iLoop<a.length;iLoop++){ a[iLoop]=b[(iLoop+d)%a.length]; } return a; } But Really good solution though.`

pathakavinash58 + 0 comments how did you do that it is amazing...how can you think like that.....

[deleted] + 0 comments nice explanation genius

Subhrasanta + 0 comments Brilliant

DarkHokage + 0 comments very cool way of doing!

29rohitkumar01 + 0 comments Your approach to this problem was great and one correction if d > n then in those cases you should recompute d as d = d%n;

cu_16bcs2416 + 0 comments cool! i mean hats off

handiputratjioe + 0 comments [deleted]smonasco + 0 comments If the number of rotations is greater than the number of elements, than this can still throw an IndexOutOfBounds as (i+n-d) is negative.

To solve this one can use a true modulus function like Math.floorMod(i-d, n) which rather than returning the remainder returns a modulus. https://stackoverflow.com/questions/5385024/mod-in-java-produces-negative-numbers

urushakhan1997 + 0 comments Yes this code is useful.

yash_agarwal_cs3 + 0 comments wow bro you are great

lochek_alon + 0 comments array[(i+n-d)%n] = scan.nextInt();

How did you come up with this idea? I was puzzled with this task for two days and still didn't succeed in it...

himashineesakthi + 0 comments hey, your logic is cool . but i dont understand it . like i am not able to figure out how it works (in the logical sense ) . why do you add n in(i+n-d)? It would be really nice if you explain . thank you

ankgzp22 + 0 comments what a piece of outstanding code........well done

preetkewl + 0 comments Nice....

riteshc6 + 4 comments Just calculate the effective number of rotations d % n and then simply change the list accordingly. Simple Pythonic solution with O(1) complexity:

`def rotate(a, r): l = a[r:] + a[:r] return l if __name__ == '__main__': nd = input().split() n = int(nd[0]) d = int(nd[1]) a = list(map(int, input().rstrip().split())) r = d % n print(*rotate(a,r))`

billatarun6 + 1 comment why did you add '*' in print(*rotate(a,r))????

tanujbafila01 + 0 comments '*' here is unpacking the items of the list that is returned from rotate method.

chopra_chirag002 + 1 comment [deleted]chopra_chirag002 + 1 comment [deleted]chopra_chirag002 + 0 comments def rotation(a): l=a[::-1] for i in range(d): r=l.pop() l.insert(0,r) return(l[::-1])

`Hy my logic is corrct I have checked it in python compiler using custom input but i am unable to return the output in hackerrank compiler. help me out here`

jcrivrodz + 0 comments [deleted]jcrivrodz + 2 comments I had a similar approach. Mine is slower but doesnt use extra memory. Question: Your solution duplicates the memory since L is another list the same size of a ?

`def rotateLeft(n ,d , a): i = 0 while i < (d % n): a.append(a.pop(0)) i += 1 print(*a)`

k_ashishmaurya11 + 0 comments you can do it without another list here is the solution...

if

**name**== '**main**': nd = input().split() n = int(nd[0]) d = int(nd[1]) a = list(map(int, input().rstrip().split())) r = d % n print(*(a[r:]+a[:r]))adityakalra581 + 0 comments Nice concise code. One question: as d%n is returning d only in every test case so why not use d here instead of d%n.

I have used d in the loop and it worked every time.

Am I missing something here?

atanusenstudy + 0 comments Thank you, GOOD EXPLANATION

03anoushkapalvia + 0 comments I have coded the same logic in c++ and I am getting a segmentation fault.

raghav14 + 0 comments If you're looking for something more easy to understand:

public class Solution { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int d = scan.nextInt(); int[] array = new int[n]; for(int i=0; i<n;i++) { if(i-d < 0) array[n+(i-d)] = scan.nextInt(); else array[i-d] = scan.nextInt(); } for(int i=0; i<n;i++) { System.out.print(array[i] + " "); } } }

chen081501 + 0 comments [deleted]jezz007 + 0 comments Another method for those who are concerned about manipulating existing array:

`for(int i=1;i<n+1;i++) { if(i<=n-d) { cout<<a[(i+d)-1]<<" "; } else { cout<<a[(i-n+d)-1]<<" "; } }`

hoa2000kxpt + 0 comments Good job, bro!

binni_pushker + 0 comments Why not to use Collections.rotate()

abkumar192000 + 0 comments Amazing

madhumaa2000 + 0 comments wow.. super,What a logic... nice###:)

vprasad77 + 0 comments It will not work out if d>n.

nighmared + 1 comment came to the comments for the lulz was impressed instead! thats a very clever way of doing it

chopra_chirag002 + 1 comment i know bro but i am not getting placed in any of the companies :(

nighmared + 1 comment shit not working for u?

chopra_chirag002 + 0 comments no man

raj_27 + 0 comments [deleted]raj_27 + 0 comments [deleted]priyank_ithikkat + 0 comments static int[] rotLeft(int[] a, int d) { //d= d%5;

`int [] r = new int[a.length];`

`for(int i=0; i<a.length; i++){ r[i]= a[(i+d)%5]; } return r; }`

Daybson + 0 comments Great solution. Congratulations.

kumarnavin2000 + 0 comments this works only when d<=n/2.

arunmahesh353 + 0 comments If "d" is greater than "n" , for example take n=5 and d = 10 let me take arr[5] = {1,2,3,4,5} for 10 rotations ans should be same right but it does not work!!! 5 10 1 2 3 4 5 ans : 1 1878011968 1329038170 32 16.

so this method does not work for the case where the number of rotation is larger than array size!!!

sslucky8044 + 0 comments error: expected unqualified-id before ‘public’ public class Solution { ^~~~~~

yacharenikrish + 0 comments We can optimize the space complexity in the following way:

- Time complexity:
`O(n)`

- Space complexity:
`O(1)`

**Approach:**LeftRotation(ar, n, d) { reverse(0, n-1, ar); reverse(0, n-d-1, ar); reverse(n-d, n-1, ar); }

**Code:**public static void main(String[] args) { int[] ar = {1, 2, 3, 4, 5}; rotate(ar, ar.length, 4); Arrays.stream(ar).forEach(i -> System.out.print(i + " ")); } public static void rotate(int[] ar, int n, int d) { reverse(ar, 0, n - 1); reverse(ar, 0, n - d - 1); reverse(ar, n - d, n - 1); } private static void reverse(int[] ar, int l, int r) { while (l < r) { int temp = ar[r]; ar[r] = ar[l]; ar[l] = temp; l++; r--; } }

- Time complexity:
Abhilash_tyagi + 0 comments great.... i did this but my time complexity was high...

sarthaksingh0050 + 0 comments this logic is lit like what was your approach?? how did you found out (i+n-d)%n??

ShkKiit + 14 comments Neatest code to get this done!!!

int n,d; cin>>n; int a[n]; cin>>d; for(int i=0;i<n;cin>>a[i],i++); d=d%n; for(int i=d;i<n;i++) cout<<a[i]<<" "; for(int i=0;i<d;i++) cout<<a[i]<<" "; return 0;

rajatbarman + 1 comment awesome :)

ShkKiit + 1 comment Thanks :)

sainimohit23 + 0 comments you deserve my respect sir........ AWESOME

thahimumhassanm1 + 0 comments MASHA ALLAH...good logic...simple nd awesome...thanx,4 sharing this..

krsoni + 2 comments You didn't actually rotated the array, printing the required answer is not the solution. The rotated array might be of some use later in the actual program and the problem is designed to practice the array rotation. Hope you try to understand.

ShkKiit + 1 comment I understand that. But in this question i was required just to print the rotated form so i did the same. If i was to use the array later on, it wouldn't have been tough to declare a new array and start storing in it using a counter variable. So i kept it simple here just to pass all the test cases :)

vamphonephong + 0 comments "A left rotation operation on an array of size n shifts each of the array's elements d unit to the left."

That opening problem statement alone means that you need to shift an existing array; not just print the array in the shifted order.

grublob + 0 comments Right

SuperGogeta + 1 comment I do understand d=d%n but in this instance it isn't necessary, question's constraints says

`1<d<n`

ShkKiit + 0 comments Sometimes coders are extra-careful i guess !

TimSylvester + 1 comment You're over-complicating things with two loops and C arrays in C++.

`int n, d; cin >> n >> d; vector<int> v((istream_iterator<int>(cin)), istream_iterator<int>()); for (int i = 0; i < n; ++i) cout << v[(i + d) % n] << " ";`

giorgi_nakeuri + 0 comments Using 2 loops is not overcomplicating. Overcomplicating is your "code". I would be angry for my emloyee if he writes such code like yours. Looking at 2 loops everybody gets in mere second what is going on. Looking at your code one needs to waste much more time figuring out what is going on there.

learner_codes + 0 comments splendid :)

narutocas143 + 0 comments please explain the logic thanks in advance

GIWMCoder + 0 comments [deleted]kalpit_jain0407 + 0 comments Thanks.Its a smart way to solve the question

_yash_agarwal_ + 0 comments as neat as it can get! so satisfying!

anoop_jain10 + 0 comments but this is just printing data as required . if u check array then no rotation had occured

Skymyweakness + 0 comments awesome ^_^

fcoda_96 + 0 comments I loved the way you simplify this, but...

`cin>>n; int a[n];`

wtf? "a" is a static array, and you set it's size from a variable ¿?

navneetdodani + 0 comments You are just merely printing the result.It might pass all the test cases but the problem to actually shift the array remains unsolved . In your code the array is still the same.

PkkdGuy + 2 comments Simplest one liner in python

for value in (arr[d:] + arr[0:d]): print value,

whtiger + 1 comment WHat if d is larger than n?

the_igor + 1 comment d is always smaller than or equal to n, see the constraints

isahurrutia + 1 comment Same idea, but if d is an integer with no restrictions, this works:

shifted = a[d%n:] + a[:d%n] for num in shifted: print(num, end=' ')

_elf_ + 1 comment print(*(a[d:]+a[:d]))

atharvakadlag + 0 comments print(*[a[i%n] for i in range(d % n,(d % n)+n)])

dalalrohit102 + 0 comments Simply briliiant ;). Thank you!

Kanahaiya + 4 comments Hello friends,

Arrays left rotation - In this video, I have explained Arrays left rotation hackerrank solution algorithm. hackerrank Arrays left rotation problem can be solved by using auxilary array.

If interested to know more about the generic algorithm in details-

click here for the

**video explanation of generic algorithm**with complexity analysis.or you can click on the image too to follow youtube tutorial.

**Here is the working solution:-****source code :**static int[] rotLeft(int[] a, int d) { int n = a.length; int[] rotArray = new int[n]; for (int oldIndex = 0; oldIndex < n; oldIndex++) { int newIndex = (oldIndex + n - d) % n; rotArray[newIndex] = a[oldIndex]; } return rotArray; }

Would really appreciate your feedback like, dislike , comment etc. on my video.

# Do not forget to upvote, if you find it useful.

i_am_ironman + 1 comment Thanks bud.

Kanahaiya + 0 comments most welcome. It would be great if you can provide your feedback like, dislike , comment etc. on my video. It motivate me to do more for you all

pol_alok + 1 comment Thanks bro, it mathematical approach I like it. but i thing you done misticks in this code? for (int oldIndex = 0; oldIndex < n; oldIndex++) { int newIndex =

**(oldIndex + d) % n;**rotArray[newIndex] = a[oldIndex]; }Kanahaiya + 0 comments thanks buddy for pointing the typo in code. I have corrected the same.

rohit_singhania + 1 comment It should be

new index=(old index+n-d)%n;

Kanahaiya + 0 comments thanks buddy for pointing the typo in code. I have corrected the same.

husaria33 + 0 comments Hello, thank you for sharing your approach with us. I have a question : Is using auxiliary array allowed? In the problem description we can read the following : "A left rotation operation on an array of size n shifts each of the array's elements unit to the left...". Please note the word

*shifts*. Because of that, I assume that we must operate on only 1 array. Is my assumption wrong?

hoseong_a_lee + 1 comment I don't know where to put my solution...

limpingandroid + 1 comment I saw this was different than the other problems. I put it in the bottom of main, using n, d and a.

Are you using C? There appears to be a bug in the original code in their loop that builds a. This is my fix to their problem:

`// bug in original code - only check endptr if we need to do another loop // if (a_item_endptr == a_item_str || *a_item_endptr != '\0') { exit(EXIT_FAILURE); } if (a_item_endptr == a_item_str) { exit(EXIT_FAILURE); } if (i < (n-1)) { if (*a_item_endptr != '\0') { exit(EXIT_FAILURE); } } *(a + i) = a_item;`

limpingandroid + 0 comments And here is my solution in C, avoiding any actual rotation and the time and possibly memory hit that would incur:

`for (int j = 0; j < n; j++) { if (j+d < n) printf ("%d ",*(a+j+d)); else printf ("%d ",*(a+j-(n-d))); } printf("\n");`

Sort 1881 Discussions, By:

Please Login in order to post a comment