freeCodeCamp/problem-62-cubic-permutations.english.md at c5a087f8b734f9eff9ad6966014d3f6cc88f7034

Files

Kristofer Koishigawa 6cfd0fc503 fix: improve Project Euler descriptions, challenge seeds, and test cases (#38016 )

* fix: improve Project Euler descriptions and test case

Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54

* feat: add typeof tests and gave functions proper names for first 100 challenges

* fix: continue fixing test descriptions and adding "before test" sections

* fix: address review comments

* fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays

* fix: implement bug fixes and improvements from review

* fix: remove console.log statements from seed and solution

2020-02-28 06:39:47 -06:00

1.1 KiB

Raw Blame History

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f3aa1000cf542c50febd	5	Problem 62: Cubic permutations	302174

Description

The cube, 41063625 (345³), can be permuted to produce two other cubes: 56623104 (384³) and 66430125 (405³). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube.

Find the smallest cube for which exactly five permutations of its digits are cube.

Instructions

Tests

tests:
  - text: <code>cubicPermutations()</code> should return a number.
    testString: assert(typeof cubicPermutations() === 'number');
  - text: <code>cubicPermutations()</code> should return 127035954683.
    testString: assert.strictEqual(cubicPermutations(), 127035954683);

Challenge Seed

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

cubicPermutations();

Solution

// solution required

1.1 KiB Raw Blame History