Files
freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.english.md
Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828)
* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown
2018-10-20 23:32:47 +05:30

60 lines
915 B
Markdown

---
id: 5900f49b1000cf542c50ffae
challengeType: 5
title: 'Problem 303: Multiples with small digits'
---
## Description
<section id='description'>
For a positive integer n, define f(n) as the least positive multiple of n that, written in base 10, uses only digits ≤ 2.
Thus f(2)=2, f(3)=12, f(7)=21, f(42)=210, f(89)=1121222.
Also, .
Find .
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler303()</code> should return 1111981904675169.
testString: assert.strictEqual(euler303(), 1111981904675169, '<code>euler303()</code> should return 1111981904675169.');
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler303() {
// Good luck!
return true;
}
euler303();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>