diff --git a/challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json b/challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json
index 1b06261e49..6759752480 100644
--- a/challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json
+++ b/challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json
@@ -34,19 +34,23 @@
       "_id": "5900f36e1000cf542c50fe81",
       "challengeType": 5,
       "type": "bonfire",
-      "title": "Problem 2: Even Fibonacci numbers",
+      "title": "Problem 2: Even Fibonacci Numbers",
       "tests": [
-        "assert.strictEqual(euler2(), 4613732, 'message: <code>euler2()</code> should return 4613732.');"
+        "assert.strictEqual(fiboEvenSum(10), 188, 'message: <code>fiboEvenSum(10)</code> should return 188.');",
+        "assert.strictEqual(fiboEvenSum(23), 60696, 'message: <code>fiboEvenSum(23)</code> should return 60696.');",
+        "assert.strictEqual(fiboEvenSum(43), 1485607536, 'message: <code>fiboEvenSum(43)</code> should return 1485607536.');",
+        "assert.strictEqual(fiboEvenSum(18), 3382, 'message: Your function is not returning the correct result using our tests values.');",
+        "assert.equal(fiboEvenSum(31) % 2 === 0, true, 'message: Your function should return an <code>even</code> value.');"
       ],
       "solutions": [],
       "translations": {},
       "challengeSeed": [
-        "function euler2() {",
-        "  // Good luck!",
+        "function fiboEvenSum(number) {",
+        "  // You can do it!",
         "  return true;",
         "}",
         "",
-        "euler2();"
+        "fiboEvenSum(10);"
       ],
       "description": [
         "Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:",
@@ -640,11 +644,11 @@
       "type": "bonfire",
       "title": "Problem 20: Factorial digit sum",
       "tests": [
-        "assert.strictEqual(sumFactorialDigits(10), 27, 'message: \u003ccode\u003esumFactorialDigits(10)\u003c/code\u003e should return 27.');",
-        "assert.strictEqual(sumFactorialDigits(25), 72, 'message: \u003ccode\u003esumFactorialDigits(25)\u003c/code\u003e should return 72.');",
-        "assert.strictEqual(sumFactorialDigits(50), 216, 'message: \u003ccode\u003esumFactorialDigits(50)\u003c/code\u003e should return 216.');",
-        "assert.strictEqual(sumFactorialDigits(75), 432, 'message: \u003ccode\u003esumFactorialDigits(75)\u003c/code\u003e should return 432.');",
-        "assert.strictEqual(sumFactorialDigits(100), 648, 'message: \u003ccode\u003esumFactorialDigits(100)\u003c/code\u003e should return 648.');"
+        "assert.strictEqual(sumFactorialDigits(10), 27, 'message: <code>sumFactorialDigits(10)</code> should return 27.');",
+        "assert.strictEqual(sumFactorialDigits(25), 72, 'message: <code>sumFactorialDigits(25)</code> should return 72.');",
+        "assert.strictEqual(sumFactorialDigits(50), 216, 'message: <code>sumFactorialDigits(50)</code> should return 216.');",
+        "assert.strictEqual(sumFactorialDigits(75), 432, 'message: <code>sumFactorialDigits(75)</code> should return 432.');",
+        "assert.strictEqual(sumFactorialDigits(100), 648, 'message: <code>sumFactorialDigits(100)</code> should return 648.');"
       ],
       "solutions": [],
       "translations": {},