Next Permutation | Love Babbar DSA Sheet Q15 | Arrays | (Leetcode 31)

[@deepjyotidas37]

i have watched this problem in many videos but didn't get it including in striver video but you made it clear,your teaching is gold.

[@sanamunikumar1512]

This video helped me to solve Next permutation, i followed Striver's also but couldn't resolve the issue. Thank you sooo much for the video.

[@surabhichoubey2987]

Bhiya aaj se pahle itne tarike se code Maine kisi channel Mai ni dekha great work keep uploading

[@udaykulkarni5639]

This paper pen idea is marvelous !! Keep it up

[@avinashsingh7722]

Bhaiya yeh paper wala idea bahut shi h 🔥

[@CodingWithPrakash_]

Okay

[@Web-mp7mp]

the best explanation of this question on youtube, i have seen 3-4 other "sheet makers" but none of them discus the logic like this, i also approached this problem in this exact way but was not able to formulate the logic thanks a ton

[@mohdtabish_1]

imo it is one of the best solution i have ever seen on this topic.

[@mdabuzar9300]

bahut sahi.... papr pen idea sahu h

[@nikhildwivedi2106]

good explaination

[@parth2439]

i have watched this problem in many videos( including striver) for 2 days but was not able to understand it but you made it clear, thanks

[@CodingWithPrakash_]

Glad it helped

[@aniruddhachunne3011]

aap banao sir videos...mai dekh raha hu... 2 din me 18 videos to dekh hi li maine

[@aviralkaushik9425]

perfect so clear explanation .

[@madanmohanpachouly6135]

Bahut sahee bhai

[@abhijitbiradar]

great video. detail explanation. Thanks

[@Eklavyasharma-p2i]

brother keep making videos you helping us a lot

[@arpitasingh6849]

Thank you bro ....

[@CodingWithPrakash_]

Welcome

[@017farazbintariq9]

bohott bdia bhai

[@AyushSachan2211]

best explanation. thanks

[@highlights334]

Thanks bhai pen paper explanation was superb😀😀

[@byomakeshpanda8055]

Finally concept clear hua warna feel hi nahi aa raha tha iska Thank you😇

[@CodingWithPrakash_]

Great

[@shreysom2060]

Thankx bhai

[@arththakur8247]

best video

[@AlaskaAlaska-xq4gk]

Bhaiya very nice explanation

[@SonuKumar-uq2rb]

great job keep it up

[@humtohchutiyehai1016]

Nice Explanation

[@Vishal_84_k]

Tnx for this💕💕

[@DeepakAhirwar-j7i]

thank you sir best explaination.❣

[@CodingWithPrakash_]

Most welcome

[@tripletgamingbuddies5365]

💗💗💗

[@alankritshukla4954]

Nicely explained ☺️

[@pratik4809]

Good explanation

[@adityarathi3420]

Thanks Sir :-)

[@abd9641]

Nice explanation brother keep uploading videos like this ❤❤❤

[@snehajoywal17]

The way you explain is much pretty and specially Hindi🥰 keep it up ⭐

[@vinamrasangal8436]

hi sneha, in which college r u studying ?

[@abhishekranjan1094]

Awesome

[@jatinukey4062]

Literally finally now i have understood this problem😊

[@shubham8943]

awsome explanation ✌👍

[@abhijeetchourasia1198]

keep going on and please also touch topic of Low level Desgin

[@mrinmoyhalder7293]

thanks, specially ye dip point kya kahe raha h, keep it up

[@h.k.creation8944]

Excellent brother ❤💯

[@CodingWithPrakash_]

Thanks ✌️

[@CodingWithPrakash_]

Thanks ✌️

[@shishirbhargav9627]

PERFECT KEEP IT UP

[@uttamsharma8600]

amazing explanation

[@CodingWithPrakash_]

Thanks

[@sahilvashisht_0462]

class Solution { public void nextPermutation(int[] nums) { int n = nums.length; int k = n-2; //null check if(n==0 || nums==null){ return; } //find k for(int i = n-1;i>0;i--){ if(nums[i]0;i--){ if(nums[i]>nums[k]){ int temp = nums[i]; nums[i]=nums[k]; nums[k]=temp; break; } } reverse(nums,k+1,n-1); } void reverse(int[] nums, int start, int end){ while(start

[@vitaminprotein2217]

agr 3124 hota toh ,phele 2 aur 4 ko arrange krna padta?

[@ayusharun6924]

If the number is large in size,then how can I calculate next permutations

[@djdholan]

sir please start this series and complete all of these quetions

[@sarada_rout]

👍🏽

[@arunchouhan5392]

Ceri on

[@arunchouhan5392]

Aalas mat karo hum tumhare sath he

[@atifakhtar8828]

bhai k=n-2 samajh nhi aaya ..iteration second last se shuru kyun hogi?????agar secod last se shuru hogi to to fir last element ka comaprison ho nhi paeyga? plz explain kr dom aap

[@vinamrasangal8436]

shukla ji ne kya haal hai pehchana mujhe ?

[@razzneupane4012]

Bhaiya I have been stucked in the test case [5,1,1]...Could you pls help me out........ int n=nums.length; int k=n-2; if(nums.length==0 || nums==null) { return; } //find k for(int i=n-1;i>0;i--) { if(nums[i]=0;i--) { if(nums[i]>nums[k]) { int temp=nums[k]; nums[k]=nums[i]; nums[i]=temp; break; } } reverse(nums,k+1,n-1); } void reverse(int[] nums,int start,int end) { while(start

[@CodingWithPrakash_]

Yaar copy pen leke dry run kro Apko hi fyada hoga usse cos interview mai bhi dry run krna hota hai This way u will also find bug in your code Good exercise for engineers

[@visheshsahu-yn8wz]

hi can you please provide the code

[@gopaltiwari5564]

paper pen supremency

[@CodingWithPrakash_]

✅ Useful Links 𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦 - instagram.com/codingwithprakash/ 𝐖𝐡𝐚𝐭𝐬𝐀𝐩𝐩𝐂𝐡𝐚𝐧𝐧𝐞𝐥 - whatsapp.com/channel/0029VaACtTa4tRrpDCQc5f44 𝐋𝐢𝐧𝐤𝐞𝐝𝐢𝐧 - www.linkedin.com/in/prakash-shukla/

[@SahilKumar-fp4xd]

bhai code nhi chal raha

[@ankurverma8792]

bhai thoda aur detail me video banao nah bro

[@uttamsharma8600]

amazing explanation

[@CodingWithPrakash_]

Thanks