Files
freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.english.md
Kristofer Koishigawa 6cfd0fc503 fix: improve Project Euler descriptions, challenge seeds, and test cases (#38016)
* fix: improve Project Euler descriptions and test case

Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54

* feat: add typeof tests and gave functions proper names for first 100 challenges

* fix: continue fixing test descriptions and adding "before test" sections

* fix: address review comments

* fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays

* fix: implement bug fixes and improvements from review

* fix: remove console.log statements from seed and solution
2020-02-28 06:39:47 -06:00

70 lines
2.1 KiB
Markdown

---
id: 5900f3c71000cf542c50feda
challengeType: 5
title: 'Problem 91: Right triangles with integer coordinates'
forumTopicId: 302208
---
## Description
<section id='description'>
The points P (<var>x</var><sub>1</sub>, <var>y</var><sub>1</sub>) and Q (<var>x</var><sub>2</sub>, <var>y</var><sub>2</sub>) are plotted at integer co-ordinates and are joined to the origin, O(0,0), to form ΔOPQ.
<img class="img-responsive center-block" alt="a graph plotting points P (x_1, y_1) and Q(x_2, y_2) at integer coordinates that are joined to the origin O (0, 0)" src="https://cdn-media-1.freecodecamp.org/project-euler/right-triangles-integer-coordinates-1.png" style="background-color: white; padding: 10px;">
There are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate lies between 0 and 2 inclusive; that is, 0 ≤ <var>x</var><sub>1</sub>, <var>y</var><sub>1</sub>, <var>x</var><sub>2</sub>, <var>y</var><sub>2</sub> ≤ 2.
<img class="img-responsive center-block" alt="a diagram showing the 14 triangles containing a right angle that can be formed when each coordinate is between 0 and 2" src="https://cdn-media-1.freecodecamp.org/project-euler/right-triangles-integer-coordinates-2.png" style="background-color: white; padding: 10px;">
Given that 0 ≤ <var>x</var><sub>1</sub>, <var>y</var><sub>1</sub>, <var>x</var><sub>2</sub>, <var>y</var><sub>2</sub> ≤ 50, how many right triangles can be formed?
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>rightTrianglesIntCoords()</code> should return a number.
testString: assert(typeof rightTrianglesIntCoords() === 'number');
- text: <code>rightTrianglesIntCoords()</code> should return 14234.
testString: assert.strictEqual(rightTrianglesIntCoords(), 14234);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function rightTrianglesIntCoords() {
// Good luck!
return true;
}
rightTrianglesIntCoords();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>