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

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

## Description
<section id='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? 
</section>

## Instructions
<section id='instructions'> 

</section>

## Tests
<section id='tests'>

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

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

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

euler172();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>