Rotate Array | Leetcode 189 | Top 150 interview question series

[@yashvardhansingh1903]

Hello mam, I don't know how to thank you because you are amazing, The way you teach , the way you solve the problems, applying the approach is much easier even for hard problems, Thank you so much mam for this amazing content........

[@TechnosageLearning]

Thanks for the feedback.. Stay tuned for more videos :)

[@dibyendusaha1295]

Time complexity: O(n) Space complexity: O(1) public class Solution { public void Rotate(int[] nums, int k) { int n=nums.Length; k=k%n; swap(nums,0,n-k-1); swap(nums,n-k,n-1); swap(nums,0,n-1); } private void swap(int[] nums, int left,int right) { while(left

[@swastikkumar5773]

Mam please continue your leetcode problem series . it will helpful for us

[@ssss22144]

Please continue❤ "Don't stop coding goosebumps loading 🎉🎉🎉"

[@sachinpatil1010]

Thank you for detailed information. It was really helpful !!!

[@MohibulIslam-m7z]

Ma'am, you are the best teacher in KZbin, please solve the top 150 DSA problem in Java ASAP , And it will help us to crack Interview. Thank you ma'am

[@dp8jl]

Great explanation, very intuitive!

[@DesiInfo619]

You teach so well!!

[@Heavy-coder11]

mene bhoot vedio dekh liye lekin nhi hua mujse i think i quit nd i got your vedio and now i easily solve thnxxx a lot mam ❤❤❤❤❤❤

[@TechnosageLearning]

Thankyou for the kind words. Will work on more videos to help everyone better

[@kaka_goat]

Really Really thank you so much mam , really appreciated your work

[@adityarajsah414]

Please do continue with the series, In entire you tube this is the only channel where I am able to understand the solution and co-relate with my approach. I understand because of medical condition you took a break, but please try uploading the videos as soon as possible please Amrita it's my humble request. And if you are not well, Get well soon and then upload the videos.

[@TechnosageLearning]

Thank you for your message. We will be starting up with the videos soon.

[@zenitsu5504]

crystal clear explanation 🙇

[@raneshmitra8156]

Please continue your Leet code problem series . it will helpful for us

[@AnbuAnbu-xj8bx]

Excellent explanation mam, please post the problem solving videos mam ❤

[@aasimahsan6167]

please continue the series of the this playlist it helps us alot

[@TechnosageLearning]

Hi Due to some medical issues..I am on break..Will continue soon

[@sanchay_khatwani]

intresting explanation

[@tricksforsolving2804]

Clear explanation, helpful for me

[@paniknoob6439]

what does the k%nums.length; do?

[@tricksforsolving2804]

​​@@paniknoob6439it fix the issue of array index out of exception,if your K is more the array length,then we don't write the value of K directly, just divisible with array length & assign to K

[@Lubi879]

Good lecture

[@lesa7p2lmansion]

why did you stop? can you put your linkedin

[@PallabChatterjee18]

Please continue the 150 questions series please maam

[@LinhTran-om6qh]

idk but this is simpler: public static void rotate(int[] nums, int k) { int n = nums.length; k = k % n; int[] lastElements = Arrays.copyOfRange(nums, n - k, n); int[] firstElements = Arrays.copyOfRange(nums, 0, n - k); System.arraycopy(lastElements, 0, nums, 0, lastElements.length); System.arraycopy(firstElements, 0, nums, lastElements.length, firstElements.length); }

[@malishagavali9225]

the space complexity is linear not constant thats the drawback

[@gaurshivam]

Please continue this series

[@TechnosageLearning]

Will start uploading soon..

[@sachintiwari4497]

thank you

[@nirajvarma-z7d]

Can any one say what to change in the code if i want it rotate by left

[@aniket5018]

i know we are taking k=k%n for out of bound exceptions but why . i mean how k=k%n can help in this situation??

[@piyumifernando2778]

Because if k = 100 (or evertime the value of k > n) after applying k = k % n the answer is k = 100 % 3 = 1. Every time it gets an answer for k which is less than n.

[@piyumifernando2778]

So out of bound exceptions didn't appear when k > n.

[@Mohd.FaisalKhan-oo9qj]

please continue your leetcode problems series

[@TechnosageLearning]

We will be continuing the series soon. We are working on it

[@AmitBiswas0142]

Another 0 ms runtime solution great!!

[@paniknoob6439]

buddy , what does the k%nums.length; do?

[@webtestingui7187]

Hello,could you please post those questions only

[@TechnosageLearning]

Hi...Yes,I will continue this series...stay tuned

[@shahbazalam162]

ma'am please continue the interview series

[@jbr.1]

Please come back

[@TechnosageLearning]

Very soon

[@CodingJoySoul]

Why have you guys stopped posting solutions?

[@TechnosageLearning]

Hi.. Due to some medical issues, We couldn't post solutions for a while..Will continue posting solutions very soon..

[@DSASolutions]

good

[@brp3522]

What happened to you amrita didi we really miss your concepts

[@B_Patidar88]

This code not accepted by leetcode 😢

[@muhammadsijal815]

you'll be back soon right ?

[@TechnosageLearning]

Yes will be back soon, the break was due to medical emergency, now will start soon.

[@muhammadsijal815]

@@TechnosageLearning when can we expect you to upload ?

[@musamehdiyevv]

public void rotate(int[] nums, int k) { int temp = 0; while (k > 0) { temp = nums[nums.length - 1]; for (int i = nums.length - 1; i > 0; i--) { nums[i] = nums[i-1]; } nums[0] = temp; k--; } }

[@Vanshkumar-co5pm]

thanks for the easier solution!!

[@anuragpanwar912]

This my updated code hopw uoy like class Solution { public void rotate(int[] arr, int k) { if(arr.length 0) { int last = arr[arr.length - 1]; for (int i = arr.length - 1; i > 0; i--) { arr[i] = arr[i - 1]; } arr[0] = last; k--; } } static void reverseArray(int arr[], int start, int end) { while (start < end) { int temp = arr[start]; arr[start] = arr[end]; arr[end] = temp; start++; end--; } } }

[@SandraSaade]

import java.util.Scanner; public class Main { public static void shiftArray(int[] a, int k) { for(int j=1;j

[@nizamuddinkhan7408]

time complexity is o(n2) which is incorrect as per leetcode

[@paniknoob6439]

what does the k%nums.length; do?

[@DavisTibbz]

Prevent overflow, just in case k is very large. This will return a value less than nums.length