From 8a327b6ca0cdce820498ffa61ce4848baa4c4ceb Mon Sep 17 00:00:00 2001 From: Alvin Kristanto Date: Sun, 26 Nov 2017 01:09:23 +0700 Subject: [PATCH] feat(seed): Added more assertions for Project Euler (#16078) --- .../project-euler-problems.json | 13 ++++++++----- 1 file changed, 8 insertions(+), 5 deletions(-) diff --git a/seed/challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json b/seed/challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json index b27b5438c3..c9ea1c5993 100644 --- a/seed/challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json +++ b/seed/challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json @@ -1247,21 +1247,24 @@ "type": "bonfire", "title": "Problem 41: Pandigital prime", "tests": [ - "assert.strictEqual(euler41(), 7652413, 'message: euler41() should return 7652413.');" + "assert(pandigitalPrime(4) == 4231, 'message: pandigitalPrime(4) should return 4231.');", + "assert(pandigitalPrime(5) == 0, 'message: pandigitalPrime(5) should return 0.');", + "assert(pandigitalPrime(6) == 0, 'message: pandigitalPrime(6) should return 0.');", + "assert(pandigitalPrime(7) == 7652413, 'message: pandigitalPrime(7) should return 7652413.');" ], "solutions": [], "translations": {}, "challengeSeed": [ - "function euler41() {", + "function pandigitalPrime(n) {", " // Good luck!", - " return true;", + " return n;", "}", "", - "euler41();" + "pandigitalPrime(7);" ], "description": [ "We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime.", - "What is the largest n-digit pandigital prime that exists?" + "What is the largest n-length digit pandigital prime that exists?" ] }, {