This site does not allow itself to be embedded. You can still read it on the original site — the toolbar below keeps your place in the directory.
The challenge Given a lowercase word, return every permutation of its letters in alphabetical order. Do not use built-in permutation libraries. Examples: permutations ( 'the' ); // → ['eht', 'eth', 'het', 'hte', 'teh', 'the'] permutations ( 'a' ); // → ['a'] This is a Codewars classic in the JavaScript track. The two stumbling blocks are generating the permutations from scratch and producing them…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.