gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Feat: add new Markdown parser (#39800)

Browse Source 
and change all the challenges to new `md` format.
This commit is contained in:
Oliver Eyton-Williams
2020-11-27 19:02:05 +01:00
committed by GitHub
parent a07f84c8ec
commit 0bd52f8bd1
2580 changed files with 113436 additions and 111979 deletions
Download Patch File Download Diff File Expand all files Collapse all files

64
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
View File

@ -1,62 +1,35 @@
---
id: 5900f4691000cf542c50ff7b
challengeType: 5
title: 'Problem 252: Convex Holes'
challengeType: 5
forumTopicId: 301900
---
## Description
<section id='description'>
# --description--
Given a set of points on a plane, we define a convex hole to be a convex polygon having as vertices any of the given points and not containing any of the given points in its interior (in addition to the vertices, other given points may lie on the perimeter of the polygon).
As an example, the image below shows a set of twenty points and a few such convex holes. The convex hole shown as a red heptagon has an area equal to 1049694.5 square units, which is the highest possible area for a convex hole on the given set of points.
As an example, the image below shows a set of twenty points and a few such convex holes.
The convex hole shown as a red heptagon has an area equal to 1049694.5 square units, which is the highest possible area for a convex hole on the given set of points.
For our example, we used the first 20 points (T2k−1, T2k), for k = 1,2,…,20, produced with the pseudo-random number generator:
S0 = 290797 Sn+1 = Sn2 mod 50515093 Tn = ( Sn mod 2000 ) − 1000
For our example, we used the first 20 points (T2k−1, T2k), for k = 1,2,…,20, produced with the pseudo-random number generator:
S0
= 
290797 
Sn+1
= 
Sn2 mod 50515093
Tn
= 
( Sn mod 2000 ) − 1000 
i.e. (527, 144), (−488, 732), (−454, −947), …
i.e. (527, 144), (−488, 732), (−454, −947), …
What is the maximum area for a convex hole on the set containing the first 500 points in the pseudo-random sequence? Specify your answer including one digit after the decimal point.
</section>
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler252()</code> should return 104924.
testString: assert.strictEqual(euler252(), 104924);
`euler252()` should return 104924.
```js
assert.strictEqual(euler252(), 104924);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler252() {
@ -67,17 +40,8 @@ function euler252() {
euler252();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>