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

id	challengeType	videoUrl	title
5900f3fa1000cf542c50ff0d	5		问题142：完美的方形集合

Description

找到具有整数x> y> z> 0的最小x + y + z，使得x + y，x-y，x + z，x-z，y + z，y-z都是完美正方形。

Instructions

Tests

tests:
  - text: <code>euler142()</code>应返回1006193。
    testString: assert.strictEqual(euler142(), 1006193);

Challenge Seed

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

euler142();

Solution

// solution required

/section>