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.
aab should return 2 because it has 6 total permutations (
baa), but only 2 of them (
aba) don't have the same letter (in this case
Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code.