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

id, challengeType, title

id	challengeType	title
5900f3fa1000cf542c50ff0d	5	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.

Instructions

Tests

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

Challenge Seed

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

euler142();

Solution

// solution required