30 seconds of codeBack to Home
⚠️ WARNING: This function's execution time increases exponentially with each character. Anything more than 8 to 10 characters will cause your browser to hang as it tries to solve all the different combinations.
Generates all permutations of a string (contains duplicates).
For each letter in the given string, create all the partial permutations for the rest of its letters.
Array.prototype.map() to combine the letter with each partial permutation, then
Array.prototype.reduce() to combine all permutations in one array.
Base cases are for string
length equal to