String Permutations - Understanding Recursion | Learn Algorithms with Phanto

preview_player
Показать описание
Calculating the possible permutations of string can be confusing. In this video, we will explain this interesting problem in more detail.
Рекомендации по теме
Комментарии
Автор

I went through 5 videos to understand this concept.... And now i am satisfied 😊

pratyugna
Автор

Thanks for the step-by-step code-tracing using a graph. Very helpful.

annas
Автор

WOW Thank you!!! This is the best explanation I’ve found for this problem!!!

RushOrbit
Автор

Trying to understand it for so long and now it is crystal clear,
thanks a lot.

Aryan-nmfh
Автор

This was a massive help to me, thank you so much! Got through a bunch of videos before I found this one, and it explains it perfectly. Nicely broken down and taught! Thank you c:

willyoung
Автор

I have been having hard time understanding this problem, a huge thanks!, I got it understand pretty well, please continue making such, your style of teaching not only provides info, but also answers the questions that we have while listening, , keep going!🙌.

abirajrajendran
Автор

This is the best explanation for this problem i have seen on the internet.

sak
Автор

This is brilliant Sir, please upload more content. Thank You.

eminentm
Автор

Best explanation ever! Thank you so much!

Kellykelly
Автор

Hey Dear Phanto, That was literally the easiest to understand if someone will try logic on pen and paper. Well Explained

bitqahdi
Автор

Thank u so much....make more videos ...u explain so well!!

selflearner
Автор

Holy shit man!!! U made me understand this so quickly!! Subscribed

monzteredits
Автор

best explanation and elephant's questions helps to clear my doubts

extremetech
Автор

i hope u get million subs, now word to explain about explanation and doubts and one thing is asking question is excelent

udaykiran
Автор

that elephant poping up concept was really innovative.keep it up

dailymotivation
Автор

Thank you for the video! One question regarding the time complexity. Are you sure that it's "n!"? n! is only for the case when left == right, but that condition is not always true. Before left == right, a lot of "calculate" execution takes place, actually n*n! times. Also, swap operation and printing operation also time consuming, it's around O(n), so for each n*n! there is additional O(n). So wouldn't we have O(n^2*n!) complexity?

zelimkhankhalidov
Автор

This was really a great video!!! Helped me a lot
I wish u could make more

chilverisonalkoushik
Автор

please make more videos, your videos are awesome

sakshisikka
Автор

Could you please upload more videos.... it is really helpful...

anjuashok
Автор

This was a great video . Finaaly I understood and plz make more videos 👌🏻👌🏻👍

shubhamsoni