Back to Freecodecamp

Problem 142: Perfect Square Collection

curriculum/challenges/english/blocks/project-euler-problems-101-to-200/5900f3fa1000cf542c50ff0d.md

latest483 B
Original Source

--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