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

---
id: 5900f3aa1000cf542c50febd
challengeType: 5
title: 'Problem 62: Cubic permutations'
---

## Description
<section id='description'>
The cube, 41063625 (3453), can be permuted to produce two other cubes: 56623104 (3843) and 66430125 (4053). 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.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler62()</code> should return 127035954683.
    testString: assert.strictEqual(euler62(), 127035954683, '<code>euler62()</code> should return 127035954683.');

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler62() {
  // Good luck!
  return true;
}

euler62();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>