Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

39 lines
622 B
Markdown

---
id: 5900f4181000cf542c50ff2b
title: 'Problem 172: Investigating numbers with few repeated digits'
challengeType: 5
forumTopicId: 301807
dashedName: problem-172-investigating-numbers-with-few-repeated-digits
---
# --description--
How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?
# --hints--
`euler172()` should return 227485267000992000.
```js
assert.strictEqual(euler172(), 227485267000992000);
```
# --seed--
## --seed-contents--
```js
function euler172() {
return true;
}
euler172();
```
# --solutions--
```js
// solution required
```