Next Permutation | Live Coding with Explanation | Leetcode - 31

[@AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!! Questions you might like: ✅✅✅[ Tree Data Structure ] : kzbin.info/aero/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls ✅✅✅[ Graphs Data Structure ] : kzbin.info/aero/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C ✅✅✅[ December Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA ✅✅✅[ November Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e ✅✅✅[ August Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe ✅✅✅July Leetcoding challenges: kzbin.info/aero/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC- ✅✅✅June Leetcoding challenges: kzbin.info/aero/PLJtzaiEpVo2xIfpptnCvUtKrUcod2zAKG ✅✅✅May Leetcoding challenges: kzbin.info/aero/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e ✅✅✅Cracking the Coding Interview - Unique String: kzbin.info/aero/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE Struggling in a question?? Leave in a comment and we will make a video!!!🙂🙂🙂

[@dipanshu266]

Nicely Explained. I had seen so many videos for this question but your way of explaining this question was different from others and awesome too.

[@angadrajsingh4311]

best explanation so far.. Thanks. However if you reduce the movement of j til j > i rather that j >= 0, time will go 0ms and 100% fast as the required range for us is i to j only.

[@davidlalmuanpuiasailo3366]

Nice, I made this one change to the code and it went good

[@alphabeta644]

This was the best described solution for this problem, after I tried searching and went through at least 5 other solutions.

[@AlgorithmsMadeEasy]

Thank you!!

[@araneuskyuro]

Thank you Ma'am. This helped me a lot. Clear, concise explanation!

[@shubhamkamdi6606]

You made this so easy to understand, I just couldn’t understand any of the algos on the other leetcode guide channels.

[@AlgorithmsMadeEasy]

Most welcome!! happy to help

[@rahulcajetandcosta5430]

Thank you ur explanation was clear and simple to understand

[@rishabh02126]

Thanks for such an informative video. Your way of explaining the problem was quite simple and hence easy to grab the solution.

[@AlgorithmsMadeEasy]

Glad it helped

[@ayushikhandal4874]

good solution !! much better than others !!

[@codebits2120]

So far smart explanation 😁,I was thinking it very complex way

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@karanalang1573]

good short video .. however, it will be good if you provide info on reason why the steps get the next permutation as well .. btw, the same detail should be present in all other videos as well

[@rohithchittibommala2002]

at 2:36 next highest number is 5 not 4

[@AlgorithmsMadeEasy]

We need the number just greater than 1 and not the highest number to form the next permutation. In the array the next higher number after 1 is 4 and not 5. Hope this clears up the doubt.

[@rohithchittibommala2002]

@@AlgorithmsMadeEasy yes

[@aanishas1925]

Thank you, you have named your channel right 😊

[@kshitijgarg2609]

best explanation

[@AlgorithmsMadeEasy]

Thanks for liking

[@AnaGuerra03]

great video, thank you

[@RitikSingh-bt3gp]

great explanation but please take more test cases for a clear cut understanding. Thanks!

[@vashishth_04]

well explained

[@lovneetchugh8063]

best explanation so far

[@vasugaur1283]

great explanation worth watching your videos

[@AlgorithmsMadeEasy]

Thanks !! Glad you like our videos !!

[@deeptidip9864]

Bestest explanation♥️♥️

[@AlgorithmsMadeEasy]

Thanks a lot 😊

[@vijayakumareyunni6010]

Good explanation of steps

[@vikupilot]

Very well explained which I want.

[@AlgorithmsMadeEasy]

Thanks !!

[@_HarshitSharma]

Best Explanation for this Question on YT so far. Thankyou @AlgorithmsMadeEasy :)

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@RaushanKumar-vc1qu]

Just awesome ma'am

[@AlgorithmsMadeEasy]

Thanks !!

[@carefree_ladka]

In second example , how is 4 next is higher number in the left array as we have 5?

[@gamingbar3881]

In line 9, it should be nums[j] >= nums[i]... because we are finding the next greater element of nums[i].

[@andressalazargaleano6419]

excellent explaination

[@AlgorithmsMadeEasy]

Thanks Andrés!! 🙂🙂

[@jungyunjo3712]

Thank you! It helped me

[@adarshjoshi6018]

Please tell me why did you started i pointer with arr.length - 2; ????

[@rohitkumarsingh3122]

Nice explaination

[@AlgorithmsMadeEasy]

Thanks, Rohit!!

[@AP-eh6gr]

good solution!

[@mrjava18]

Man......that's Dope...!!!😍

[@AlgorithmsMadeEasy]

Thanks !!

[@swarnavachakraborty7644]

2:02 it's increasing from end, not decreasing

[@revanthrajashekar5983]

That's an excellent explanation. However, in the second while loop, I think it should be while(j > 0) and not j >=0. For the input [1, 1], j gets -1 and the -1 index is used during swapping, which is OOB

[@soheekim5927]

love the video!

[@midhurammanoj931]

Thanks!

[@praveenanand5689]

will sorting work instead of reversing ?

[@shreyanshjamuar8921]

Amazing

[@AlgorithmsMadeEasy]

Thank you! Glad you liked it !!

[@INDRASENAREDDYCBME]

at 2:29 5 is greater than 4 right?

[@lukearnold6754]

We need the number just greater than 1 and not the highest number to form the next permutation. In the array the next higher number after 1 is 4 and not 5.

[@soumyajitchatterjee5822]

For your code why did you set your int i to array.size()-2? IS there a specific reason.

[@AlgorithmsMadeEasy]

Because the comparison of indexes is between i and i+1 starting from the rear end. If we would take i as size-1, we would get an IndexOutOfBoundsException for size as at that point we would be comparing indexes size-1 and size.. Hope this helps.

[@abhishekbehera2193]

Finally someone explained it well!!!

[@nithinsharma7623]

can u please explain int i =num.length - 2 and j = num.length - 1 in the progrem

[@ankuranubhav1928]

i is the 2nd last element and j is the last. So we start from the second last and then compare it with the last as a starting point to find the Point of change

[@thelast2233]

What's your codeforces id?

[@9-1939]

👌

[@abhishekranjan1094]

Mam please reply..how I'll solve [3,2,1]

[@harshitsaluja3493]

When we try to sort this array as the array the point of change is from the starting you need to either sort the whole array or reverse the whole array.

[@sggffdgcx3769]

Are you mad what is decreasing and what is increasing

[@gamingbar3881]

In line 9, it should be nums[j] >= nums[i]... because we are finding the next greater element of nums[i].. Right??

[@guo7580]

@@gamingbar3881 I don’t think so. Just swap the found element with the one right higher than it from the remaining right-handed sequence. So just proceed with it until nums[j] > nums[i] for exiting while loop.. this j is where we want to swap to.