Permutations Of String using recursion backtracking(Data Structures and Algorithms #5)(Recursion #2)

Print all the permutations of the given string.
Link of the code:

[jyl]

One of the most patient guy that would spend the actual time drawing the recursion calls! Huge respect to you.

[VinodKumar-pfun]

This problem needs patience and intelligence for visualization and implementation, great job, really appreciated :)

[Bakasta]

cannot it be done simply with the help of a Queue by constantly polling first element and then adding it at the end of Queue again??

[mohammedsuhailbasha]

Very nice explaination.after seeing more videos finally I understand in your lecture.Thank you so much sir

[suryakumarp]

watch at 1.75x or 2x to save ur was really amazing.thumbs up.

[bharathramkarthikeyan]

can u make a video on sudoko solving using recursion

[arpanchaudhuri]

Thanks for elaborative explanation, Recursion is tough to visualize, so this call stack drawings are very helpful.

[spec]

I have started preparing for interviews. Thank you for your hard-work.

[AKASH-swbs]

i need a little help sir. i liked your logic very much but i want to implement you logic in c++ but i am a beginner and i can't convert the logic into code . can you please help me providing the code using c++ . i am learning backtracking it will help me very much . thanks in advance sir.

[arpitasood]

you're way of teaching is awesome sir

[saurabhsinghscuboid]

Can you please explain the time complexity of the algorithm? I believe it is n* n!

[ctbram]

Your description is nearly incomprehensible. After watching 4 times now I am more confused than ever! Too many ums and ers and flipping screens and clearly misstating things. My head was ready to explode!

[krishika]

You didn't handle the duplicate case, what is there is input like- A A B C, your code fails to return the expected output.