Commit graph

1 commit

Author SHA1 Message Date
William Carroll
bbea699f06 Complete string permutations problem
Solves an InterviewCake.com problem that returns all of the permutations of a
string input. The problem states that it's acceptable to assume that your input
string will not have repeated characters, which is why using a Set is
acceptable. I like this solution because it builds a permutations tree and then
assembles all of the permutations by doing a DFT over that tree.
2020-01-22 10:09:46 +00:00