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

fix: remove guide linting and fix failing challenges

Browse Source
This commit is contained in:
Oliver Eyton-Williams
2019-07-19 11:04:45 +02:00
committed by mrugesh
parent f809100406
commit b8593326b0
8 changed files with 13 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
curriculum/challenges/english/08-coding-interview-prep/rosetta-code/24-game.english.md
View File

@ -13,7 +13,7 @@ The aim of the game is to arrange four numbers in a way that when evaluated, the
## Instructions
<section id='instructions'>
Implement a function that takes a string of four digits as its argument, with each digit from 1 to 9 (inclusive) with repetitions allowed, and returns an arithmetic expression that evaluates to the number 24. If no such solution exists, return "no solution exists".
<h4><strong>Rules:</strong></h4>
<ul>
<li> Only the following operators/functions are allowed: multiplication, division, addition, subtraction. </li>
@ -170,4 +170,4 @@ function solve24(numStr) {
```
</section>
</section>

2
curriculum/challenges/english/08-coding-interview-prep/rosetta-code/deal-cards-for-freecell.english.md
View File

@ -49,6 +49,7 @@ The algorithm follows:
['6S', '9C', '2H', '6H']
]
```
<strong>Game #617</strong>
```js
@ -62,6 +63,7 @@ The algorithm follows:
['JD', 'KS', 'KC', '4H']
]
```
</section>
## Instructions

1
curriculum/challenges/english/08-coding-interview-prep/rosetta-code/department-numbers.english.md
View File

@ -28,6 +28,7 @@ Write a program which outputs all valid combinations as an array.
[4, 7, 1] [6, 1, 5] [6, 2, 4]
[6, 4, 2] [6, 5, 1]
```
</section>
## Tests

6
curriculum/challenges/english/08-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.english.md
View File

@ -17,7 +17,7 @@ Rules have the syntax:
There is one rule per line.
If there is a <code>.</code> (period) present before the [replacement], then this is a terminating rule in which case the interpreter must halt execution.
A ruleset consists of a sequence of rules, with optional comments.
<big><big>Rulesets</big></big>
<span style="font-size: 1.5rem">Rulesets</span>
Use the following tests on entries:
<strong>Ruleset 1:</strong>
<pre>
@ -52,7 +52,7 @@ Should generate:
<strong>Ruleset 3:</strong>
This tests for correct substitution order and may trap simple regexp based replacement routines if special regexp characters are not escaped.
<pre>
#BNF Syntax testing rules
# BNF Syntax testing rules
A -> apple
WWWW -> with
Bgage -> ->.*
@ -106,7 +106,7 @@ A simple <a href="http://en.wikipedia.org/wiki/Turing_machine" title="link: http
The tape consists of <code>0</code>s and <code>1</code>s, the states are <code>A</code>, <code>B</code>, <code>C</code> and <code>H</code> (for <code>H</code>alt), and the head position is indicated by writing the state letter before the character where the head is. All parts of the initial tape the machine operates on have to be given in the input.
Besides demonstrating that the Markov algorithm is Turing-complete, it also made me catch a bug in the C++ implementation which wasn't caught by the first four rulesets.
<pre>
#Turing machine: three-state busy beaver
# Turing machine: three-state busy beaver
#
# state A, symbol 0 => write 1, move right, new state B
A0 -> 1B