Arrays Left Rotation HackerRank Solution

[@JavaAidTutorials]

JAVAAID community: KZbin recently changed the way they monetize my content. My channel now needs 1,000 subscribers so it would be awesome if you could show your support by both watching my videos and subscribing to my channel. please hit the like button too, if you find it useful. if you haven’t already done so. Monetizing my videos allows me to invest back into the channel with new equipment so a small gesture from you goes a huge way for me. Many thanks for your support!

[@sunilpatra9037]

Wow, Amazed. That was quick. Thank you

[@suchitragiri4546]

yeah!! i got your point Thank you so muchh sir , i solved this problem using this logic but still i confused so , i decided to watching your video. Now i know the logic which is behind the code. 😊

[@igorbarros9620]

I just wanna say thank you, man! I really appreciate your efforts creating this videos with explanations.

[@JavaAidTutorials]

Glad you like them!

[@srikarchatla5178]

awesome bro you were just very clear about this i loved it

[@mihirk953]

Excellent explanation. Very easy to understand. Thanks very much for providing this.

[@JavaAidTutorials]

Most welcome..:)

[@FirMizzZ]

thanks. your channel is the best explanation. keep doing.

[@dilipshukla2135]

Awesome observation and explanation!!!! I am happy to come acrossed this post on first day of the new year !!!! Thanks for sharing!!!

[@JavaAidTutorials]

Thanks a lot for your lovely feedback. 😊 If you find our channel helpful, please do share among your friends.

[@aakashmudigonda3375]

You are an excellent teacher❤️

[@JavaAidTutorials]

Thanks for the compliment 😊

[@humzarahman1945]

Very helpful, thank you so much!

[@perihanhill4397]

Thank you so much! I missed % in my program and was trying to understand what's going on. Please share more codes! :)

[@JavaAidTutorials]

Most welcome 😊

[@HugoAyala1983]

Perfect solution and formula explanation such a clean solution

[@JavaAidTutorials]

Glad you think so!

[@vigneshhendrix4447]

Just Vera Level Bro!✨🔥. Expecting more !✨

[@JavaAidTutorials]

😊

[@vrashankraom]

By vector u can solve like this vector rotLeft(vector a, int d) { vectorarr; for(int j=d;j

[@sushmitgoswami6836]

is the same thing will work when rotation d is greater than array lenght?

[@SoupTurtle16]

Thanks for showing me an unique method of solving this

[@JavaAidTutorials]

Most welcome..

[@munazzainamulhaque8863]

Such a nice explanation ...Plz make more videos on Interview Preparation Kit

[@JavaAidTutorials]

Thanks and sure. We already have a playlist which has couple of videos, you can go through that. kzbin.info/aero/PLSIpQf0NbcCleuffqepcYEU5HLoSY8B_X will add more videos to it future.

[@officialnizam]

very good explanation

[@JavaAidTutorials]

thanks, Nizam for your feedback. Keep watching, keep commenting. It really motivates me to do more and better for you all. please hit the like button too, if you find it useful.

[@poomaniraj9375]

Super Explanations

[@JavaAidTutorials]

thank you..

[@dibasbaral4740]

Nice explanation keep it up

[@JavaAidTutorials]

Thanks @Dibas

[@org2989]

Where did you put the input? I did exactly the same as you did but I dont have the array's elements..

[@JavaAidTutorials]

cross verify once, May be you have done some mistake code while implementing it

[@ketanlalcheta4558]

Can we avoid additional space of new array and sort in place from existing array ?

[@kraisk]

That's quite easy if you use an additional array. Now, try to do this in place.

[@arshneetkathuria4999]

this logic is not working for rotation which are greater than length of array.....sir kindly tell any other optimal solution.

[@JavaAidTutorials]

Can you provide your input and share your code? because this solution is tested and working fine.

[@charanp9931]

Thumps up

[@JavaAidTutorials]

Thanks..

[@martinomamic]

Hi, first of all, thanks for your efforts, I haven't been doing these for a while now and getting back into it. What do you think about this solution? I've taken into account that array is smaller than "d". func rotLeft(a: [Int], d: Int) -> [Int] { var rearranged: [Int] = [] let arraySize = a.count let dividerIndex = arraySize > d ? d : d % arraySize rearranged = a.suffix(arraySize - dividerIndex) + a.prefix(dividerIndex) return rearranged }

[@shaone_syem]

One other solution that crossed my mind is using a linked list so that we add the first d elements at the end while also moving the head. Complexity O(d).

[@DharmendraKumar-ut2bn]

What if d=1, then RR will be more complex, right ?

[@aishwaryaverma7129]

if we had to do a right rotation then it would have been newindex=oldindex%n ?Is this correct?

[@JavaAidTutorials]

what about d, you did not considered d at all in your formula then how you are going to find the new array without d ? just for analogy purpose- Suppose, people are standing in a queue as mention below (added their rank on top which can treat as index)- 1 2 3 4 5 6 7 💃💃💃💃 🚶💃💃 how far away the boy is? if look from left side, boy is on 5th place but if you look from the right side he is on 3rd place. and the same concept is used here to find left and right rotation...🙂

[@vishalcoder4964]

What is the exact space complexity of this code? I guess O(n), if so we can try Reversal Algorith that takes O(1) Space complexity... need not to mention, a very good approach followed here too!! hats ^

[@JavaAidTutorials]

It is enough to say, time complexity is inversely propositional to space. So based on give constraint people can choose which approach they have to follow.

[@AK_sheikh933]

Sir I need help in one question in Dsad solving airport solution

[@JavaAidTutorials]

you can ping me on Instagram, will review it, if possible will surely upload video on that.

[@AK_sheikh933]

@@JavaAidTutorials Thanks sir..I sent

[@brandon-22]

now if i understood what you talk it would be perfect

[@JavaAidTutorials]

Sorry, I did not get your comment. Did you understand this problem or not?

[@anonymous8038-c4m]

What about if we are trying to rotate n times?

[@JavaAidTutorials]

Hi Rishabh, if you use the formula which is mentioned in the video you can see for rotating n times if you take modulo with n then result will be 0. it means no rotation at all. after n rotation array will become the same as it was in starting.

[@jiteshkumar3112]

the array will remain same

[@sanandapodder5027]

i am getting output in array not in String though converted to String, help me sir

[@JavaAidTutorials]

Did not get you. paste your code here with detailed explaination.

[@damodaranm3044]

bro why dont u star a telegram or whatapp group . so the i we have any doubts u may sole it

[@JavaAidTutorials]

We already have couple of telegram channels and groups, even whatsapp group as well, just check out the description of any video, you will come to know...😜

[@AshuYadav-lk4rp]

what is the complexity of this ? can it be better ?

[@JavaAidTutorials]

both time & space complexity for this solution is O(n).

[@indianking0017]

why this logic works only in java not in python or c++

[@JavaAidTutorials]

The explained logic was generic, it should work in all language. would suggest try pasting your code here, will try to review it.

[@indianking0017]

U r absolutly right i will revisit an check might be i was do8ng sm silly mistake..as i tried i c++ then in python then i have to do it in java there it worked.! Soo ill be seding the codes if still i can't debugg thanks javaaid page is soo helpful!!

[@pradeepmondal4943]

Bro , we need 0(1) space solution

[@kevinhu7581]

This is only work when d

[@claire3946]

I still don't get it. Why right rotation??

[@JavaAidTutorials]

Let me explain in another way, if 10 people are standing in a row and someone ask who is standing at 6th position then there are two ways to find it, either from front (or left) will go to 6th place or from back(from right) we can go to 4th place. Hoping this analogy can help you to understand this better.