diff --git a/seed/challenges/01-front-end-development-certification/advanced-bonfires.json b/seed/challenges/01-front-end-development-certification/advanced-bonfires.json
index 5ce1ff1abc..42b752a3d5 100644
--- a/seed/challenges/01-front-end-development-certification/advanced-bonfires.json
+++ b/seed/challenges/01-front-end-development-certification/advanced-bonfires.json
@@ -405,9 +405,12 @@
"id": "a3f503de51cfab748ff001aa",
"title": "Pairwise",
"description": [
- "Return the sum of all element indices of array arr
that can be paired with one other element to form a sum that equals the value in the second argument arg
. If multiple sums are possible, return the smallest sum. Once an element has been used, it cannot be reused to pair with another.",
- "For example, pairwise([1, 4, 2, 3, 0, 5], 7)
should return 11
because 4, 2, 3 and 5 can be paired with each other to equal 7 and their indices (1, 2, 3, and 5) sum to 11.",
- "pairwise([1, 3, 2, 4], 4)
would only return 1
, because only the first two elements can be paired to equal 4, and the first element has an index of 0!",
+ "Given an array arr
, find element pairs whose sum equal the second argument arg
and return the sum of their indices.",
+ "If multiple pairs are possible that have the same numeric elements but different indices, return the smallest sum of indices. Once an element has been used, it cannot be reused to pair with another.",
+ "For example pairwise([7, 9, 11, 13, 15], 20)
returns 6
. The pairs that sum to 20 are [7, 13]
and [9, 11]
. We can then write out the array with their indices and values.",
+ "
Index | 0 | 1 | 2 | 3 | 4 |
---|---|---|---|---|---|
Value | 7 | 9 | 11 | 13 | 15 |
6
",
"Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code."
],
"challengeSeed": [