freeCodeCamp/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md

---
id: 5900f3fa1000cf542c50ff0d
title: 'Problema 142: Coleção de quadrados perfeitos'
challengeType: 5
forumTopicId: 301771
dashedName: problem-142-perfect-square-collection
---

# --description--

Encontre a menor soma de $x + y + z$, com números inteiros $x > y > z > 0$, tal que $x + y$, $x – y$, $x + z$, $x – z$, $y + z$, $y – z$ sejam todos quadrados perfeitos.

# --hints--

`perfectSquareCollection()` deve retornar `1006193`.

```js
assert.strictEqual(perfectSquareCollection(), 1006193);
```

# --seed--

## --seed-contents--

```js
function perfectSquareCollection() {

  return true;
}

perfectSquareCollection();
```

# --solutions--

```js
// solution required
```