From ee086ae693ef5e3caa2dc3b43425ad23ae873341 Mon Sep 17 00:00:00 2001
From: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Date: Mon, 26 Feb 2018 21:40:09 +0900
Subject: [PATCH] perf(challenges): Remove Multiple Calls to Challenge Function
 in Project Euler Problems (#16733)

Removed multiple calls to the challenge function in Project Euler
problems 11 and 14. Also adjusted the spacing of the tests array for
problem 23 to make it consistent with the rest of the file.

BREAKING CHANGE: None
---
 .../project-euler-problems.json                       | 11 ++++-------
 1 file changed, 4 insertions(+), 7 deletions(-)

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 8e8b8b8dec..882aa89685 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
@@ -350,7 +350,6 @@
           "  [7, 97, 57, 32, 16]",
         "];",
         "",
-        "largestGridProduct(grid);",
         "largestGridProduct(testGrid);"
       ],
       "description": [
@@ -673,9 +672,7 @@
         "  return true;",
         "}",
         "",
-        "longestCollatzSequence(14);",
-        "longestCollatzSequence(5847);",
-        "longestCollatzSequence(1000000);"
+        "longestCollatzSequence(14);"
       ],
       "description": [
         "The following iterative sequence is defined for the set of positive integers:",
@@ -938,9 +935,9 @@
       "title": "Problem 23: Non-abundant sums",
       "tests": [
         "assert(sumOfNonAbundantNumbers(10000) === 3731004, 'message: <code>sumOfNonAbundantNumbers(10000)</code> should return 3731004.');",
-		"assert(sumOfNonAbundantNumbers(15000) === 4039939, 'message: <code>sumOfNonAbundantNumbers(15000)</code> should return 4039939.');",
-		"assert(sumOfNonAbundantNumbers(20000) === 4159710, 'message: <code>sumOfNonAbundantNumbers(20000)</code> should return 4159710.');",
-		"assert(sumOfNonAbundantNumbers(28123) === 4179871, 'message: <code>sumOfNonAbundantNumbers(28123)</code> should return 4179871.');"
+        "assert(sumOfNonAbundantNumbers(15000) === 4039939, 'message: <code>sumOfNonAbundantNumbers(15000)</code> should return 4039939.');",
+        "assert(sumOfNonAbundantNumbers(20000) === 4159710, 'message: <code>sumOfNonAbundantNumbers(20000)</code> should return 4159710.');",
+        "assert(sumOfNonAbundantNumbers(28123) === 4179871, 'message: <code>sumOfNonAbundantNumbers(28123)</code> should return 4179871.');"
       ],
       "solutions": [],
       "translations": {},