Find all permutations of a string using recursion.

recursive-permutations.js

function getPermutations(string, p) {
  if(string.length <= 1) return new Set(string)
    
   let allCharsExceptLast = string.slice(0, -1)
   let lastChar = string[string.length - 1]
   
   let permutationsOfAllCharsExceptLast = getPermutations(allCharsExceptLast);
    
    let permutations = new Set()
    for(let perm of permutationsOfAllCharsExceptLast) {
    	for(let position=0; position <= allCharsExceptLast.length; position++) {
        	let permutation = perm.slice(0, position) + lastChar + perm.slice(position)
            permutations.add(permutation)
        }
    }
    return permutations
}