freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f3aa1000cf542c50febd	Problem 62: Cubic permutations	5	302174	problem-62-cubic-permutations

--description--

The cube, 41063625 (345^3), can be permuted to produce two other cubes: 56623104 (384^3) and 66430125 (405^3). 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 n permutations of its digits are cube.

--hints--

cubicPermutations(2) should return a number.

assert(typeof cubicPermutations(2) === 'number');

cubicPermutations(2) should return 125.

assert.strictEqual(cubicPermutations(2), 125);

cubicPermutations(3) should return 41063625.

assert.strictEqual(cubicPermutations(3), 41063625);

cubicPermutations(4) should return 1006012008.

assert.strictEqual(cubicPermutations(4), 1006012008);

cubicPermutations(5) should return 127035954683.

assert.strictEqual(cubicPermutations(5), 127035954683);

--seed--

--seed-contents--

function cubicPermutations(n) {

  return true;
}

cubicPermutations(2);

--solutions--

function cubicPermutations(n) {
  function getDigits(num) {
    const digits = [];
    while (num > 0) {
      digits.push(num % 10);
      num = Math.floor(num / 10);
    }
    return digits;
  }

  function getCube(num) {
    return num ** 3;
  }

  const digitsToCubeCounts = {};
  let curNum = 1;
  let digits;

  while (!digitsToCubeCounts[digits] || digitsToCubeCounts[digits].count < n) {
    const cube = getCube(curNum);
    digits = getDigits(cube).sort().join();
    if (!digitsToCubeCounts[digits]) {
      digitsToCubeCounts[digits] = {
        count: 1,
        smallestCube: cube
      };
    } else {
      digitsToCubeCounts[digits].count += 1;
    }

    curNum++;
  }
  return digitsToCubeCounts[digits].smallestCube;
}