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

39 lines
658 B
Markdown
Raw Normal View History

---
id: 5900f3fa1000cf542c50ff0d
title: 'Problem 142: Perfect Square Collection'
challengeType: 5
forumTopicId: 301771
dashedName: problem-142-perfect-square-collection
---
# --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.
# --hints--
`perfectSquareCollection()` should return `1006193`.
```js
assert.strictEqual(perfectSquareCollection(), 1006193);
```
# --seed--
## --seed-contents--
```js
function perfectSquareCollection() {
return true;
}
perfectSquareCollection();
```
# --solutions--
```js
// solution required
```