freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.spanish.md

id	localeTitle	challengeType	title
5	5900f4181000cf542c50ff2b	5	Problem 172: Investigating numbers with few repeated digits

Description

¿Cuántos números de 18 dígitos n (sin ceros a la izquierda) hay de tal manera que no aparezca un dígito más de tres veces en n?

Instructions

Tests

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

Challenge Seed

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

euler172();

Solution

// solution required