Coding interview question - Next Permutation - Arrays

[@vishalpapnai5461]

best explanation for this question i have watched till now. Thanks to you.

[@seniorx9173]

best sir

[@reyou7]

best explanation ever.

[@jaydave2500]

thanks it was great approach....pls make more videos we are waiting.

[@sabalniroula26]

Best explanation keep it up !!!

[@anshumanpandey6526]

great explanation

[@satyamrajsingh7378]

brilliant explaination

[@HimanshuSharma-tm2ms]

great explanation.. also ..Pls put the link to the question so that we can solve the question and submit it

[@dynamo7731]

Thank you

[@HimanshuSharma-tm2ms]

time complexity must be O(nLogn) in the case that we swap the first element and sort from index 1 to n-1

[@pranav5951]

u need not sort as it is in decreasing order, it just needs to be reversed.

[@anujkhare3815]

firstly,we are not sorting,we are reversing the array. Secondly,you can reverse in linear time by maintaing two pointers and swapping them. just google reversing an array using 2 pointers.