freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-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

859 B

id, challengeType, title
id challengeType title
5900f4181000cf542c50ff2b 5 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?

Instructions

Tests

tests:
  - text: <code>euler172()</code> should return 227485267000992000.
    testString: assert.strictEqual(euler172(), 227485267000992000, '<code>euler172()</code> should return 227485267000992000.');

Challenge Seed

function euler172() {
  // Good luck!
  return true;
}

euler172();

Solution

// solution required