No description
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. |
||
---|---|---|
advent-of-code | ||
crack_the_coding_interview | ||
data_structures_and_algorithms | ||
deepmind | ||
haskell-file | ||
.gitignore | ||
README.md |
Mono
This is my mono-repo. Having a personal mono-repo is a new idea for me, so at the time of this writing, the state of this repository is fledgling.
I'm attempting to amass a collection of functions across a variety of languages while minimizing the costs of sharing the code across a projects. Stay tuned for more updates as my definition of the mono-repo becomes more clear, my opinions evolve, and my preferences change.