Add Algorithm String Permutation

String/PermutateString.js

@@ -0,0 +1,33 @@
+'use strict'
+
+const permutate = (aString) => {
+  if (typeof aString !== 'string' || !aString) {
+    throw new Error('The arg must be a valid, non empty string')
+  }
+  const characters = aString.split('')
+  let permutations = [[characters.shift()]]
+  while (characters.length) {
+    const currentCharacter = characters.shift()
+    permutations = calculateCurrentCharacterPermutation(permutations, currentCharacter)
+  }
+  return permutations
+    .map(character => character.join(''))
+    .filter((item, index, self) => (self.indexOf(item) === index))
+    .sort()
+}
+
+const calculateCurrentCharacterPermutation = (allPermutations, currentCharacter) => {
+  const currentPermutations = []
+  allPermutations.map(permutation => {
+    let index = 0
+    while (index <= permutation.length) {
+      const tmp = [...permutation]
+      tmp.splice(index, 0, currentCharacter)
+      currentPermutations.push(tmp)
+      index++
+    }
+  })
+  return currentPermutations
+}
+
+export { permutate }

String/PermutateString.test.js

@@ -0,0 +1,17 @@
+import { permutate } from './PermutateString'
+
+describe('Permutate a string', () => {
+  it('expects to throw an Error with an empty string', () => {
+    expect(() => { permutate() }).toThrow('The arg must be a valid, non empty string')
+  })
+  it('expects to permute "no" into [no, on]', () => {
+    expect(['no', 'on']).toEqual(permutate('no'))
+  })
+  it('expects to permute "yes" into [esy, eys, sey, sye, yes, yse]', () => {
+    expect(['esy', 'eys', 'sey', 'sye', 'yes', 'yse']).toEqual(permutate('yes'))
+  })
+  it('expects to permute "good" into [dgoo dogo doog gdoo godo good odgo odog ogdo ogod oodg oogd ]', () => {
+    expect(['dgoo', 'dogo', 'doog', 'gdoo', 'godo', 'good', 'odgo', 'odog', 'ogdo', 'ogod', 'oodg', 'oogd'])
+      .toEqual(permutate('good'))
+  })
+})