freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-43-sub-string-divis...

67 lines
1.4 KiB
Markdown

---
id: 5900f3971000cf542c50feaa
challengeType: 5
title: 'Problem 43: Sub-string divisibility'
forumTopicId: 302100
---
## Description
<section id='description'>
The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.
Let d1 be the 1st digit, d2 be the 2nd digit, and so on. In this way, we note the following:
d2d3d4=406 is divisible by 2
d3d4d5=063 is divisible by 3
d4d5d6=635 is divisible by 5
d5d6d7=357 is divisible by 7
d6d7d8=572 is divisible by 11
d7d8d9=728 is divisible by 13
d8d9d10=289 is divisible by 17
Find the numbers of all 0 to 9 pandigital numbers with this property.
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>substringDivisibility()</code> should return [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ].
testString: assert.deepEqual(substringDivisibility(), [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ]);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function substringDivisibility() {
// Good luck!
return [];
}
substringDivisibility();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>