From 5e2df87518d9898922be0b8e0eb8e1699f2387a7 Mon Sep 17 00:00:00 2001
From: Eric Leung <eric@erictleung.com>
Date: Wed, 6 Apr 2016 12:44:04 -0700
Subject: [PATCH] Clarify all characters are unique in No Repeats

---
 .../advanced-bonfires.json                                      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/challenges/01-front-end-development-certification/advanced-bonfires.json b/challenges/01-front-end-development-certification/advanced-bonfires.json
index 42b752a3d5..15701fee38 100644
--- a/challenges/01-front-end-development-certification/advanced-bonfires.json
+++ b/challenges/01-front-end-development-certification/advanced-bonfires.json
@@ -223,7 +223,7 @@
       "id": "a7bf700cd123b9a54eef01d5",
       "title": "No repeats please",
       "description": [
-        "Return the number of total permutations of the provided string that don't have repeated consecutive letters. Assume that duplicate characters are each unique.",
+        "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, <code>aab</code> should return 2 because it has 6 total permutations (<code>aab</code>, <code>aab</code>, <code>aba</code>, <code>aba</code>, <code>baa</code>, <code>baa</code>), but only 2 of them (<code>aba</code> and <code>aba</code>) don't have the same letter (in this case <code>a</code>) repeating.",
         "Remember to use <a href='//github.com/FreeCodeCamp/freecodecamp/wiki/How-to-get-help-when-you-get-stuck' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
       ],