@navinchainani4721
First i don't understand programming i finds it too difficult then i started coding from u YouTube channel after that i understand coding very nicely
@yashsalvi5043
How do you come up with such logics bro ? Legit 🐐
@reevarastogi6224
very nice explaination!!
@Mike-mw1fu
Thank for helping me in optimizing code
@satyasantosh3143
Very good explanation!
@ashutoshaswal
From your reply on my solution! Thanks for helping me in optimizing the code!
@R_S_R_389
thank u very much brother..
@navinchainani4721
Bro u are best YouTuber u are making future of ours keep doing bro
@abhinashbihari2881
We can use next_permutation(s.begin,s.end) to get next lexicographical greater string
@sagarock1012
Hey! I didn't get the question , how is "abcd" > "abdc" Thank you
@arunkumarvaithiyanathan9808
Please Explain Line 32: int firstSmallChar=charArray[endindex-1] why should we convert char to int ? Instead of do like Line 32: int firstSmallChar=endindex-1; Line 37: In 'if' condition (charArray[startindex]>charArray[firstSmallChar]) Thanks in Advance!!
@anuragsekhri2315
well explained
@kratikavarshney1106
Thanks. Very clear
@GG-sw9vm
Does this work with "dkhc", with the logic, it will be d k h c, since d < k, we swap out c which is the smallest character to the right, now it becomes c k h d, after sorting c d h k which is wrong.
@codeminatiinterviewcode6459
I was doing the same thing but just using an extra string for return and hence HRank was giving Segmentation Fault... And I wasted 2 Hrs. in Detecting Error of Memory overload... I hope this helps... :)
@susritipal3747
Sir why you take endindex = n-1, extend- -, In the loop please explain
@linuxtubers7313
Thanks
@rogercute2002
Why not "ecdfhi" is the answer?
@tanmaysinghal8370
Bro please make the video solution for all the solution that is in there in your GitHub.
@JavaAidTutorials