JavaScript: Generate all permutations of a string

JavaScript fundamental (ES6 Syntax): Exercise-136 with Solution

Write a JavaScript program to generate all permutations of a string (contains duplicates).

• 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.
• Use Array.prototype.reduce() to combine all permutations in one array.
• Base cases are for String.prototype.length equal to 2 or 1.
• WARNING: The execution time increases exponentially with each character. Anything more than 8 to 10 characters will cause your environment to hang as it tries to solve all the different combinations.

Sample Solution:

JavaScript Code:

//#Source https://bit.ly/2neWfJ2 
const stringPermutations = str => {
  if (str.length <= 2) return str.length === 2 ? [str, str[1] + str[0]] : [str];
  return str
    .split('')
    .reduce(
      (acc, letter, i) =>
        acc.concat(stringPermutations(str.slice(0, i) + str.slice(i + 1)).map(val => letter + val)),
      []
    );
};

console.log(stringPermutations('abc'));
console.log(stringPermutations('*$*'));

Sample Output:

["abc","acb","bac","bca","cab","cba"]
["*$*","**$","$**","$**","**$","*$*"]

Pictorial Presentation:

Flowchart:

Live Demo:

See the Pen javascript-basic-exercise-136-1 by w3resource (@w3resource) on CodePen.

Improve this sample solution and post your code through Disqus

Previous: Write a JavaScript program to get the sum of the powers of all the numbers from start to end (both inclusive).
Next: Write a JavaScript program to perform stable sorting of an array, preserving the initial indexes of items when their values are the same. Do not mutate the original array, but returns a new array instead.