andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update stringPermutations.md

Browse Source
This commit is contained in:
Angelos Chalaris
2019-11-21 22:02:13 +02:00
committed by GitHub
parent d995044ead
commit dace922242
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
snippets/stringPermutations.md
View File

@ -3,10 +3,10 @@ title: stringPermutations
tags: string,recursion,advanced
---
⚠️ **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).
⚠️ **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.
Use recursion.
For each letter in the given string, create all the partial permutations for the rest of its letters.
Use `Array.prototype.map()` to combine the letter with each partial permutation, then `Array.prototype.reduce()` to combine all permutations in one array.
@ -27,4 +27,4 @@ const stringPermutations = str => {
```js
stringPermutations('abc'); // ['abc','acb','bac','bca','cab','cba']
```
```