freeCodeCamp/curriculum/challenges/08-coding-interview-prep/project-euler/Problem 224: Almost right-angled triangles II.md

id, challengeType, title

id	challengeType	title
5900f44e1000cf542c50ff5f	5	Problem 224: Almost right-angled triangles II

Description

Let us call an integer sided triangle with sides a ≤ b ≤ c barely obtuse if the sides satisfy a2 + b2 = c2 - 1.

How many barely obtuse triangles are there with perimeter ≤ 75,000,000?

Instructions

Tests

- text: <code>euler224()</code> should return 4137330.
  testString: 'assert.strictEqual(euler224(), 4137330, "<code>euler224()</code> should return 4137330.");'

Challenge Seed

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

euler224();

Solution

// solution required