Rotate Array | Leetcode 189 | Top 150 interview question series

Top 150 interview question series
Rotate Array
Leetcode problem number 189
JAVA interview programming playlist:
• Interview Programming ...

[@sachinpatil1010]

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

[@nathlvz]

Good explanation!, It is so clear, I undestand the main concept!, Thanks for this videos, I hope more of them!

[@BharatFoods145]

You teach so well!!

[@swastikkumar5773]

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

[@user-lz9ru7os3t]

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

[@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 :)

[@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.

[@lesa7p2lmansion]

why did you stop? can you put your linkedin

[@PallabChatterjee18]

Please continue the 150 questions series please maam

[@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

[@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

[@shahbazalam162]

ma'am please continue the interview series

[@brp3522]

What happened to you amrita didi we really miss your concepts

[@gaurshivam]

Please continue this series

[@TechnosageLearning]

Will start uploading 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..

[@webtestingui7187]

Hello,could you please post those questions only

[@TechnosageLearning]

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

[@AmitBiswas0142]

Another 0 ms runtime solution great!!

[@paniknoob6439]

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

[@paniknoob6439]

what does the k%nums.length; do?

[@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--; } }

[@Mohd.FaisalKhan-oo9qj]

please continue your leetcode problems series

[@TechnosageLearning]

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

[@jbr.1]

Please come back

[@TechnosageLearning]

Very soon

[@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.

[@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--; } } }

[@user-bl1gg1ff1q]

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