32fac23a2d
* fix: clean-up Project Euler 161-180 * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
39 lines
696 B
Markdown
39 lines
696 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--
|
|
|
|
`numbersWithRepeatedDigits()` should return `227485267000992000`.
|
|
|
|
```js
|
|
assert.strictEqual(numbersWithRepeatedDigits(), 227485267000992000);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function numbersWithRepeatedDigits() {
|
|
|
|
return true;
|
|
}
|
|
|
|
numbersWithRepeatedDigits();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|