diff --git a/challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-algorithm-questions.json b/challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-algorithm-questions.json
index 97e627d0a4..a10cf6964f 100644
--- a/challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-algorithm-questions.json
+++ b/challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-algorithm-questions.json
@@ -6,7 +6,7 @@
   "challenges": [
     {
       "id": "a3f503de51cf954ede28891d",
-      "title": "Symmetric Difference",
+      "title": "Find the Symmetric Difference",
       "description": [
         "Create a function that takes two or more arrays and returns an array of the <dfn>symmetric difference</dfn> (<code>&xutri;</code> or <code>&oplus;</code>) of the provided arrays.",
         "Given two sets (for example set <code>A = {1, 2, 3}</code> and set <code>B = {2, 3, 4}</code>), the mathematical term \"symmetric difference\" of two sets is the set of elements which are in either of the two sets, but not in both (<code>A &xutri; B = C = {1, 4}</code>). For every additional symmetric difference you take (say on a set <code>D = {2, 3}</code>), you should get the set with elements which are in either of the two the sets but not both (<code>C &xutri; D = {1, 4} &xutri; {2, 3} = {1, 2, 3, 4}</code>). The resulting array must contain only unique values (<em>no duplicates</em>).",