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

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Wow!! The best explanation I have heard so far. Fantastic.

venkatmvv
Автор

best explanation to understand. very nice, really liked it

exploringgenshin
Автор

thank you for explaining this concept, its crystal clear now.

sudhirmohan
Автор

Yes but the requirements said that you needed to print the specific strings and you didn't. a is not a permutation of abc

DavidLongLife
Автор

I hope you know this is wrong. I bet if you put "bat" in there from the original question you would not get bat, bta, abt, atb, tba, tab like is said it should. And if you look at your notes you say that the number of outputs should be n! and for your "abc" example you got 7 outputs which is not 3!. You are missing permutations with your "abc" like "bac". You should have implemented a linked list or a 2-d array to solve this. Let me know if you would like some help.

DavidLongLife
Автор

can you make a video on adding and deleting an element from a binary search tree?
How do those rotations work?

abocidejofa
Автор

You changed where the print took place over the algorithm in part 2?

mikezito