Files
freeCodeCamp/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
2022-02-28 08:59:21 +01:00

39 lines
677 B
Markdown
Raw Permalink Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f3fa1000cf542c50ff0d
title: 'Problema 142: Collezione Quadrata Perfetta'
challengeType: 5
forumTopicId: 301771
dashedName: problem-142-perfect-square-collection
---
# --description--
Trova il più piccolo $x + y + z$ con interi $x > y > z > 0$ in modo che $x + y$, $x y$, $x + z$, $x z$, $y + z$, $y z$ siano tutti quadrati perfetti.
# --hints--
`perfectSquareCollection()` dovrebbe restituire `1006193`.
```js
assert.strictEqual(perfectSquareCollection(), 1006193);
```
# --seed--
## --seed-contents--
```js
function perfectSquareCollection() {
return true;
}
perfectSquareCollection();
```
# --solutions--
```js
// solution required
```