freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.english.md

id, challengeType, title

id	challengeType	title
5900f3e21000cf542c50fef5	5	Problem 118: Pandigital prime sets

Description

Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set {2,5,47,89,631}, all of the elements belonging to it are prime. How many distinct sets containing each of the digits one through nine exactly once contain only prime elements?

Instructions

Tests

tests:
  - text: <code>euler118()</code> should return 44680.
    testString: assert.strictEqual(euler118(), 44680, '<code>euler118()</code> should return 44680.');

Challenge Seed

function euler118() {
  // Good luck!
  return true;
}

euler118();

Solution

// solution required