TOP TEN

Posts

Showing posts from May, 2015

var anagrams = getAnagrams('word'); function getAnagrams(word) { word = word.toLowerCase(); var anagrams = []; // Edge case: if the word is less than two characters, it has no anagrams if (word.length < 2) { return anagrams; } // Get all permutations of the word var permutations = getPermutations(word); // Iterate through the permutations and add any that are not the original word to the anagrams array for (var i = 0; i < permutations.length; i++) { if (permutations[i] != word) { anagrams.push(permutations[i]); } } return anagrams; } // This function returns an array of all permutations of a given word function getPermutations(string) { if (string.length < 2) { return [string]; } var permutations = []; var tail = string.substr(1); var permutationsOfTail = getPermutations(tail); for (var i = 0; i < permutationsOfTail.length; i++) { var permutation = permutationsOfTail[i]; for (var j = 0; j <= permutation.length; j++) { permutations.push( permutation.substr(0, j) + string[0] + permutation.substr(j) ); } } return permutations; }