<p dir="auto">Challenge <a href="http://freecodecamp.com/challenges/bonfire-no-repeats-please" rel="nofollow">http://freecodecamp.com/challenges/bonfire-no-repeats-please</a> has an issue. Please describe how to reproduce it, and include links to screenshots if possible.</p>
<p dir="auto">The following description is incorrect, in my understanding of permutations:<br>
"<br>
Return the number of total permutations of the provided string that don't have repeated consecutive letters.</p>
<p dir="auto">For example, 'aab' should return 2 because it has 6 total permutations, but only 2 of them don't have the same letter (in this case 'a') repeating.<br>
"<br>
Number of permutations possible is 3 not 6. Off that only 1 matches the question criteria:<br>
Possible permutations:<br>
aab<br>
aba<br>
baa</p>
<p dir="auto">Only one, 'aba' matches the conditions. Please correct the bonfire question and the answer checking scripts</p>
<p dir="auto">Challenge <a href="http://freecodecamp.com/challenges/bonfire-no-repeats-please" rel="nofollow">http://freecodecamp.com/challenges/bonfire-no-repeats-please</a> has an issue. Please describe how to reproduce it, and include links to screenshots if possible.</p>
<p dir="auto">The problem states:<br>
"For example, 'aab' should return 2 because it has 6 total permutations, but only 2 of them don't have the same letter (in this case 'a') repeating."</p>
<p dir="auto">'aab' has 3 only permutations, not 6 as stated in the question. And the number of permutations that do not repeat any alphabet is 1.</p>