No Repeats Please

FCC link

Return the number of total permutations of the provided string that don't have repeated consecutive letters. Assume that all characters in the provided string are each unique.

For example, aab should return 2 because it has 6 total permutations (aab, aab, aba, aba, baa, baa), but only 2 of them (aba and aba) don't have the same letter (in this case a) repeating.

Test

Boilerplate code

Console output

Shortcuts on this page

Use Cmd instead of Ctrl if you're on a Mac.

`g`	Focus editor
`Ctrl`-`Enter`	Run the test with current code
`Ctrl`-`Shift`-`K`	Reset the editor
`Ctrl`-`Shift`-`L`	Clear console output
`Ctrl`-`Shift`-`X`	Show the solution
`[`	Previous challenge
`]`	Next challenge
`T`	Back to top page
`?`	Show this dialog
`ESC`	Hide this dialog
`Shift`-`ESC`	Blur focus from editor