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

id	challengeType	title	videoUrl	localeTitle
5900f3fa1000cf542c50ff0d	5	Problem 142: Perfect Square Collection		Problema 142: Perfect Square Collection

Description

Encuentre el x + y + z más pequeño con enteros x> y> z> 0, de modo que x + y, x - y, x + z, x - z, y + z, y - z sean todos cuadrados perfectos.

Instructions

Tests

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

Challenge Seed

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

euler142();

Solution

// solution required