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

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f3fa1000cf542c50ff0d	Problem 142: Perfect Square Collection	5	301771	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--

euler142() should return 1006193.

assert.strictEqual(euler142(), 1006193);

--seed--

--seed-contents--

function euler142() {

  return true;
}

euler142();

--solutions--

// solution required