freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f3761000cf542c50fe88	Problem 9: Special Pythagorean triplet	5	302205	problem-9-special-pythagorean-triplet

--description--

A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,

a² + b² = c²

For example, 3² + 4² = 9 + 16 = 25 = 5².

There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc such that a + b + c = n.

--hints--

specialPythagoreanTriplet(24) should return a number.

assert(typeof specialPythagoreanTriplet(24) === 'number');

specialPythagoreanTriplet(24) should return 480.

assert.strictEqual(specialPythagoreanTriplet(24), 480);

specialPythagoreanTriplet(120) should return 49920, 55080 or 60000.

assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120)));

specialPythagoreanTriplet(1000) should return 31875000.

assert.strictEqual(specialPythagoreanTriplet(1000), 31875000);

--seed--

--seed-contents--

function specialPythagoreanTriplet(n) {
 let sumOfabc = n;

 return true;
}

specialPythagoreanTriplet(1000);

--solutions--

const specialPythagoreanTriplet = (n)=>{
 let sumOfabc = n;
 let a,b,c;
 for(a = 1; a<=sumOfabc/3; a++){
 for(b = a+1; b<=sumOfabc/2; b++){
 c = Math.sqrt(a*a+b*b);
 if((a+b+c) == sumOfabc){
 return a*b*c;
 }
 }
 }
}