bbea699f06
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. |
||
---|---|---|
.. | ||
balanced-binary-tree.py | ||
inflight-entertainment.py | ||
kth-to-last.py | ||
merging-ranges.py | ||
recursive-string-permutations.py | ||
stock-price.py |