freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.spanish.md

---
id: 5900f44e1000cf542c50ff5f
challengeType: 5
title: 'Problem 224: Almost right-angled triangles II'
videoUrl: ''
localeTitle: 'Problema 224: triángulos casi rectos II'
---

## Description
<section id="description"> Llamemos a un triángulo de lados enteros con lados a ≤ b ≤ c apenas obtuso si los lados satisfacen a2 + b2 = c2 - 1. <p> ¿Cuántos triángulos apenas obtusos hay con un perímetro ≤ 75,000,000? </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

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

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

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

euler224();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>