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

---
id: 5900f3fa1000cf542c50ff0d
challengeType: 5
title: 'Problem 142: Perfect Square Collection'
---

## Description
<section id='description'>
Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
- text: <code>euler142()</code> should return 1006193.
  testString: 'assert.strictEqual(euler142(), 1006193, ''<code>euler142()</code> should return 1006193.'');'

```

</section>

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

<div id='js-seed'>

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

euler142();
```

</div>



</section>

## Solution
<section id='solution'>

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