-Given non-negative integers m and n, generate all size m combinations of the integers from 0 (zero) to n-1 in sorted order (each combination is sorted and the entire table is sorted).
+Given non-negative integers m and n, generate all size m combinations of the integers from 0 (zero) to n-1 in sorted order (each combination is sorted and the entire table is sorted).
Example:
3 comb 5 is:
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/comma-quibbling.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/comma-quibbling.english.md
index 8486878768..bc01ad6080 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/comma-quibbling.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/comma-quibbling.english.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-Comma quibbling is a task originally set by Eric Lippert in his blog.
+Comma quibbling is a task originally set by Eric Lippert in his blog.
## Instructions
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/count-the-coins.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/count-the-coins.english.md
index e9f1cca488..1a7ab2f067 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/count-the-coins.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/count-the-coins.english.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-There are four types of common coins in US currency:
+There are four types of common coins in US currency:
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/deal-cards-for-freecell.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/deal-cards-for-freecell.english.md
index 8173840e3f..2b0f54cc86 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/deal-cards-for-freecell.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/deal-cards-for-freecell.english.md
@@ -6,9 +6,9 @@ challengeType: 5
## Description
-FreeCell is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for DOS, then Windows. This version introduced 32000 numbered deals. (The FreeCell FAQ tells this history.)
-As the game became popular, Jim Horne disclosed the algorithm, and other implementations of FreeCell began to reproduce the Microsoft deals. These deals are numbered from 1 to 32000. Newer versions from Microsoft have 1 million deals, numbered from 1 to 1000000; some implementations allow numbers outside that range.
-The algorithm uses this linear congruential generator from Microsoft C:
+FreeCell is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for DOS, then Windows. This version introduced 32000 numbered deals. (The FreeCell FAQ tells this history.)
+As the game became popular, Jim Horne disclosed the algorithm, and other implementations of FreeCell began to reproduce the Microsoft deals. These deals are numbered from 1 to 32000. Newer versions from Microsoft have 1 million deals, numbered from 1 to 1000000; some implementations allow numbers outside that range.
+The algorithm uses this linear congruential generator from Microsoft C:
- $state_{n + 1} \equiv 214013 \times state_n + 2531011 \pmod{2^{31}}$
- $rand_n = state_n \div 2^{16}$
@@ -17,7 +17,7 @@ The algorithm uses this array of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.
+ - Create an array of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.
- Until the array is empty:
- Choose a random card at index ≡ next random number (mod array length).
@@ -61,7 +61,7 @@ The algorithm follows:
## Instructions
Write a function to take a deal number and deal cards in the same order as this algorithm. The function must return a two dimensional array representing the FreeCell board.
-Deals can also be checked against FreeCell solutions to 1000000 games. (Summon a video solution, and it displays the initial deal.)
+Deals can also be checked against FreeCell solutions to 1000000 games. (Summon a video solution, and it displays the initial deal.)
## Tests
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/execute-brain.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/execute-brain.english.md
index 9a7af84438..4093a362a4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/execute-brain.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/execute-brain.english.md
@@ -7,7 +7,7 @@ challengeType: 5
## Description
Write a function to implement a Brain**** interpreter. The function will take a string as a parameter and should return a string as the output. More details are given below:
-RCBF is a set of Brainf*** compilers and interpreters written for Rosetta Code in a variety of languages.
+RCBF is a set of Brainf*** compilers and interpreters written for Rosetta Code in a variety of languages.
Below are links to each of the versions of RCBF.
An implementation need only properly implement the following instructions:
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.english.md
index d3383ecc08..ed5d361855 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.english.md
@@ -9,7 +9,7 @@ challengeType: 5
A Mersenne number is a number in the form of 2P-1.
If P is prime, the Mersenne number may be a Mersenne prime
(if P is not prime, the Mersenne number is also not prime).
-In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, Lucas-Lehmer test.
+In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, Lucas-Lehmer test.
There are very efficient algorithms for determining if a number divides 2P-1 (or equivalently, if 2P mod (the number) = 1).
Some languages already have built-in implementations of this exponent-and-mod operation (called modPow or similar).
The following is how to implement this modPow yourself:
@@ -32,7 +32,7 @@ Since 223 mod 47 = 1, 47 is a factor of 2P-1.
Since we've shown that 47 is a factor, 223-1 is not prime.
Further properties of Mersenne numbers allow us to refine the process even more.
Any factor q of 2P-1 must be of the form 2kP+1, k being a positive integer or zero. Furthermore, q must be 1 or 7 mod 8.
-Finally any potential factor q must be prime.
+Finally any potential factor q must be prime.
As in other trial division algorithms, the algorithm stops when 2kP+1 > sqrt(N).These primality tests only work on Mersenne numbers where P is prime. For example, M4=15 yields no factors using these techniques, but factors into 3 and 5, neither of which fit 2kP+1.
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.english.md
index 28b57128d0..faf60ba98e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.english.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-These number series are an expansion of the ordinary Fibonacci sequence where:
+These number series are an expansion of the ordinary Fibonacci sequence where:
- For $n = 2$ we have the Fibonacci sequence; with initial values $[1, 1]$ and $F_k^2 = F_{k-1}^2 + F_{k-2}^2$
- For $n = 3$ we have the tribonacci sequence; with initial values $[1, 1, 2]$ and $F_k^3 = F_{k-1}^3 + F_{k-2}^3 + F_{k-3}^3$
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/fibonacci-word.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/fibonacci-word.english.md
index 32d6c83131..7f42d0b9a1 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/fibonacci-word.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/fibonacci-word.english.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence as described here:
+The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence as described here:
Define F_Word1 as 1
Define F_Word2 as 0
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/general-fizzbuzz.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/general-fizzbuzz.english.md
index 3797637d4b..bdd2cbb149 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/general-fizzbuzz.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/general-fizzbuzz.english.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-Write a generalized version of FizzBuzz that works for any list of factors, along with their words.
+Write a generalized version of FizzBuzz that works for any list of factors, along with their words.
This is basically a "fizzbuzz" implementation where the rules of the game are supplied to the user. Create a function to implement this. The function should take two parameters.
The first will be an array with the FizzBuzz rules. For example: [ [3, "Fizz"] , [5, "Buzz"] ].
This indcates that Fizz should be printed if the number is a multiple of 3 and Buzz if it is a multiple of 5. If it is a multiple of both then the strings should be concatenated in the order specified in the array. In this case, FizzBuzz if the number is a multiple of 3 and 5.
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hailstone-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hailstone-sequence.english.md
index f4ddc4cda0..42bbc524e0 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hailstone-sequence.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hailstone-sequence.english.md
@@ -25,7 +25,7 @@ The hailstone sequence is also known as hailstone numbers (because the values ar
See also:
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/harshad-or-niven-series.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/harshad-or-niven-series.english.md
index 222723d408..f1ba5f50b6 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/harshad-or-niven-series.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/harshad-or-niven-series.english.md
@@ -6,8 +6,8 @@ challengeType: 5
## Description
-The Harshad or Niven numbers are positive integers ≥ 1 that are divisible by the sum of their digits.
-For example, 42 is a Harshad number as 42 is divisible by (4 + 2) without remainder.
+The Harshad or Niven numbers are positive integers ≥ 1 that are divisible by the sum of their digits.
+For example, 42 is a Harshad number as 42 is divisible by (4 + 2) without remainder.
Assume that the series is defined as the numbers in increasing order.
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hash-from-two-arrays.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hash-from-two-arrays.english.md
index 4d77e67f3c..675196b159 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hash-from-two-arrays.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hash-from-two-arrays.english.md
@@ -9,7 +9,7 @@ challengeType: 5
Using two Arrays of equal length, create a Hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
Related task:
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/heronian-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/heronian-triangles.english.md
index 762c744509..c57b517021 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/heronian-triangles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/heronian-triangles.english.md
@@ -10,7 +10,7 @@ challengeType: 5
$A = \sqrt{s(s-a)(s-b)(s-c)},$
where s is half the perimeter of the triangle; that is,
$s=\frac{a+b+c}{2}.$
-Heronian triangles are triangles whose sides and area are all integers.
+Heronian triangles are triangles whose sides and area are all integers.
An example is the triangle with sides 3, 4, 5 whose area is 6 (and whose perimeter is 12).
Note that any triangle whose sides are all an integer multiple of 3, 4, 5; such as 6, 8, 10, will also be a Heronian triangle.
Define a Primitive Heronian triangle as a Heronian triangle where the greatest common divisor
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.english.md
index b4e5f12440..e4a9154fe5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.english.md
@@ -22,10 +22,10 @@ No maximum value for n should be assumed.
References
-
- Sloane's A005228 and A030124.
+ Sloane's A005228 and A030124.
-
- Wolfram MathWorld
+ Wolfram MathWorld
-
Wikipedia: Hofstadter Figure-Figure sequences.
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hofstadter-q-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hofstadter-q-sequence.english.md
index 6f992a001b..762606ffb7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hofstadter-q-sequence.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/hofstadter-q-sequence.english.md
@@ -8,7 +8,7 @@ challengeType: 5
The Hofstadter Q sequence is defined as:
$Q(1)=Q(2)=1, \\ Q(n)=Q\big(n-Q(n-1)\big)+Q\big(n-Q(n-2)), \quad n>2.$
-It is defined like the Fibonacci sequence, but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
+It is defined like the Fibonacci sequence, but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
## Instructions
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/k-d-tree.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/k-d-tree.md
index 64eb7798db..861bc56cb4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/k-d-tree.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/k-d-tree.md
@@ -14,7 +14,7 @@ Otherwise, when k-d trees are used with high-dimensional data, most of the point
## Instructions
-Write a function to perform a nearest neighbour search using k-d tree. The function takes two parameters: an array of k-dimensional points, and a single k-dimensional point whose nearest neighbour should be returned by the function. A k-dimensional point will be given as an array of k elements.
+Write a function to perform a nearest neighbor search using k-d tree. The function takes two parameters: an array of k-dimensional points, and a single k-dimensional point whose nearest neighbor should be returned by the function. A k-dimensional point will be given as an array of k elements.
## Tests
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/kaprekar-numbers.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/kaprekar-numbers.md
index 86b619add3..f26b77ba24 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/kaprekar-numbers.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/kaprekar-numbers.md
@@ -15,7 +15,7 @@ Note that a split resulting in a part consisting purely of 0s is not valid, as 0
Kaprekar numbers:
-
2223 is a Kaprekar number, as 2223 * 2223 = 4941729, 4941729 may be split to 494 and 1729, and 494 + 1729 = 2223
-- The series of Kaprekar numbers is known as A006886, and begins as
1, 9, 45, 55, ...
+- The series of Kaprekar numbers is known as A006886, and begins as
1, 9, 45, 55, ...
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/least-common-multiple.md
index e4d5031f28..ad04931f14 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/least-common-multiple.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/least-common-multiple.md
@@ -8,7 +8,7 @@ challengeType: 5
-The cocktail shaker sort is an improvement on the Bubble Sort. The improvement is basically that values "bubble" both directions through the array, because on each iteration the cocktail shaker sort bubble sorts once forwards and once backwards. Pseudocode for the algorithm (from wikipedia):
+The cocktail shaker sort is an improvement on the Bubble Sort. The improvement is basically that values "bubble" both directions through the array, because on each iteration the cocktail shaker sort bubble sorts once forwards and once backwards. Pseudocode for the algorithm (from wikipedia):
function cocktailSort( A : list of sortable items )
do
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
index 981a3a251e..a532f5fd22 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
@@ -7,8 +7,8 @@ challengeType: 5
## Description
Implement a comb sort.
-The Comb Sort is a variant of the Bubble Sort.
-Like the Shell sort, the Comb Sort increases the gap used in comparisons and exchanges.
+The Comb Sort is a variant of the Bubble Sort.
+Like the Shell sort, the Comb Sort increases the gap used in comparisons and exchanges.
Dividing the gap by $(1-e^{-\varphi})^{-1} \approx 1.247330950103979$ works best, but 1.3 may be more practical.
Some implementations use the insertion sort once the gap is less than a certain amount.
Also see
@@ -32,9 +32,9 @@ Pseudocode:
gap := 1
end if
i := 0
- swaps := 0 //see Bubble Sort for an explanation
+ swaps := 0 //see Bubble Sort for an explanation
//a single "comb" over the input list
- loop until i + gap >= input.size //see Shell sort for similar idea
+ loop until i + gap >= input.size //see Shell sort for similar idea
if input[i] > input[i+gap]
swap(input[i], input[i+gap])
swaps := 1 // Flag a swap has occurred, so the
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
index b92481ac8d..67f7337f42 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-Gnome sort is a sorting algorithm which is similar to Insertion sort, except that moving an element to its proper place is accomplished by a series of swaps, as in Bubble Sort.
+Gnome sort is a sorting algorithm which is similar to Insertion sort, except that moving an element to its proper place is accomplished by a series of swaps, as in Bubble Sort.
The pseudocode for the algorithm is:
function gnomeSort(a[0..size-1])
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/soundex.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/soundex.md
index d16a8a7d32..19a16754eb 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/soundex.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/soundex.md
@@ -8,7 +8,7 @@ challengeType: 5
Soundex is an algorithm for creating indices for words based on their pronunciation.
The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling (from the WP article).
-There is a major issue in many of the implementations concerning the separation of two consonants that have the same soundex code! According to the official Rules https://www.archives.gov/research/census/soundex.html. So check for instance if Ashcraft is coded to A-261.
+There is a major issue in many of the implementations concerning the separation of two consonants that have the same soundex code! According to the official Rules. So check for instance if Ashcraft is coded to A-261.
- If a vowel (A, E, I, O, U) separates two consonants that have the same soundex code, the consonant to the right of the vowel is coded. Tymczak is coded as T-522 (T, 5 for the M, 2 for the C, Z ignored (see "Side-by-Side" rule above), 2 for the K). Since the vowel "A" separates the Z and K, the K is coded.
- If "H" or "W" separate two consonants that have the same soundex code, the consonant to the right of the vowel is not coded. Example: Ashcraft is coded A-261 (A, 2 for the S, C ignored, 6 for the R, 1 for the F). It is not coded A-226.
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/state-name-puzzle.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/state-name-puzzle.md
index 97b04c5716..3aeb13f00c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/state-name-puzzle.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/state-name-puzzle.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [1] and originally attributed to David Edelheit.
+This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [1] and originally attributed to David Edelheit.
The challenge was to take the names of two U.S. States, mix them all together, then rearrange the letters to form the names of two different U.S. States (so that all four state names differ from one another).
What states are these?
The problem was reissued on the Unicon Discussion Web which includes several solutions with analysis. Several techniques may be helpful and you may wish to refer to Gödel numbering, equivalence relations, and equivalence classes. The basic merits of these were discussed in the Unicon Discussion Web.
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/stern-brocot-sequence.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
index 3aedf64540..35b8b4efb2 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the Fibonacci sequence.
+For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the Fibonacci sequence.
- The first and second members of the sequence are both 1:
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/subleq.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/subleq.md
index e26a8a9801..2a7ba134c7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/subleq.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/subleq.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-Subleq is an example of a One-Instruction Set Computer (OISC).
+Subleq is an example of a One-Instruction Set Computer (OISC).
It is named after its only instruction, which is SUbtract and Branch if Less than or EQual
to zero.
Your task is to create an interpreter which emulates such a machine.
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/symmetric-difference.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/symmetric-difference.md
index 8ea2a048c4..3566f1fd27 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/symmetric-difference.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/symmetric-difference.md
@@ -6,7 +6,7 @@ challengeType: 5
## Description
-Given two sets A and B, compute $(A \setminus B) \cup (B \setminus A).$
+Given two sets A and B, compute $(A \setminus B) \cup (B \setminus A).$
That is, enumerate the items that are in A or B but not both. This set is called the symmetric difference of A and B.
In other words: $(A \cup B) \setminus (A \cap B)$ (the set of items that are in at least one of A or B minus the set of items that are in both A and B).
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/taxicab-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/taxicab-numbers.english.md
index bbe08be270..296264576d 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/taxicab-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/taxicab-numbers.english.md
@@ -24,9 +24,9 @@ Taxicab numbers are also known as:
Write a function that returns the lowest n taxicab numbers. For each of the taxicab numbers, show the number as well as its constituent cubes.
See also:
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/topological-sort.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/topological-sort.english.md
index c1d02407e1..dd16cb02bf 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/topological-sort.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/topological-sort.english.md
@@ -40,12 +40,12 @@ synopsys
Note: the above data would be un-orderable if, for example, dw04 is added to the list of dependencies of dw01.
C.f.:
There are two popular algorithms for topological sorting:
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/y-combinator.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/y-combinator.english.md
index 3c81432925..b298713353 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/y-combinator.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/y-combinator.english.md
@@ -7,7 +7,7 @@ challengeType: 5
## Description
In strict functional programming and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function.
-The Y combinator is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called fixed-point combinators.
+The Y combinator is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called fixed-point combinators.
## Instructions
@@ -15,7 +15,7 @@ The Y combina
Define the stateless Y combinator function and use it to compute factorial. The factorial(N) function is already given to you.
See also: