* 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>
696 B
696 B
id, title, challengeType, forumTopicId, dashedName
id | title | challengeType | forumTopicId | dashedName |
---|---|---|---|---|
5900f4181000cf542c50ff2b | Problem 172: Investigating numbers with few repeated digits | 5 | 301807 | 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
.
assert.strictEqual(numbersWithRepeatedDigits(), 227485267000992000);
--seed--
--seed-contents--
function numbersWithRepeatedDigits() {
return true;
}
numbersWithRepeatedDigits();
--solutions--
// solution required