Problem

Print all possible permutations of a given string.
Example input:
"abc"
Example output:
"abc"
"acb"
"bac"
"bca"
"cab"
"cba"

Solution

// Solution:
// The optimal solution is to use recursion.
// The base case is when the string is empty.
// The recursive case is when the string is not empty.
// In the recursive case, we loop through the string and for each character, we add it to the beginning of the string and call the function recursively.
// We then remove the character from the beginning of the string and continue the loop.
// This solution is optimal because it is O(n!) time complexity.

function permutations(str) {
  if (str.length === 0) {
    return;
  }

  for (let i = 0; i < str.length; i++) {
    let char = str[i];
    str = char + str.slice(0, i) + str.slice(i + 1);
    permutations(str);
    str = str.slice(1);
  }
}

permutations("abc");