Permutations of a String - Computer Science Challenge Part 3/3

[@diegotrazzi]

Excellent work man ! I like how you separated the videos into intro, algorithm and code implementation.

[@gattasri]

Each n every single video of yours is really helpful. Dint missed any single video :)

[@rakeshkonda1465]

Excellent..Patiently explained... appreciate it..

[@zipcat18]

These are brilliant. Thanks so much!

[@oliviersama2150]

Thanks ! This is kinda complex for a newbie like me . will try to do it again and again!

[@itsevennow]

Hi Agilowen, Your tutorial is very helpful. I have one doubt - why did you say "remove fixed char from output and unmark it" , i.e. ater returning from recursive call. From the code it seems we remove the last char in the buffer and unmark it (it is not the first or fixed char ).Please correct me if I am wrong .Thanks.

[@codingandmathvideos]

After the first round of permutation, how does deleting the character at index (length -1) deletes the first character of the output buffer?

[@quanq8733]

excellent! thanks man!

[@jeremychan2006]

this is quite clear

[@saddamhossain2171]

Explained nicely, like that... :) But doesn't handle repeated characters.. :(

[@magicboy124]

this is the best video from a white guy ..v nice and very patiently explained

[@exploringgenshin]

cant i in for loop start at position instead of 0

[@Tali1562]

Thanks!

[@sureshreddy2966]

waste tutorial.solution don't work. so many fools over here