diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gamma-function.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gamma-function.english.md index b2671431f5..82f9e4059b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gamma-function.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gamma-function.english.md @@ -46,7 +46,7 @@ tests:
```js -function gamma (x) { +function gamma(x) { // Good luck! } ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gaussian-elimination.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gaussian-elimination.english.md index edfd12748a..de18a3562a 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gaussian-elimination.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gaussian-elimination.english.md @@ -6,7 +6,9 @@ challengeType: 5 ## Description
-Write a function to solve \(A.x = b\) using Gaussian elimination then backwards substitution. \(A\) being an \(n \times n\) matrix. Also, \(x\) and \(b\) are \(n\) by 1 vectors. To improve accuracy, please use partial pivoting and scaling. +Write a function to solve \(Ax = b\) using Gaussian elimination then backwards substitution. +\(A\) being an \(n \times n\) matrix. Also, \(x\) and \(b\) are \(n\) by 1 vectors. +To improve accuracy, please use partial pivoting and scaling.
## Instructions @@ -44,7 +46,7 @@ tests:
```js -function gaussianElimination (A,b) { +function gaussianElimination(A,b) { // Good luck! } ``` 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 320b0ca751..3797637d4b 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 @@ -8,7 +8,7 @@ challengeType: 5
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"] ]. +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. The second parameter is the number for which the function should return a string as stated above.
@@ -52,7 +52,7 @@ tests:
```js -function genFizzBuzz (rules, num) { +function genFizzBuzz(rules, num) { // Good luck! } ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.english.md index 6a3a6804a3..fb2d531df1 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.english.md @@ -6,7 +6,7 @@ challengeType: 5 ## Description
-Write a function to generate an array of lower case ASCII characters, for a given range. For example: for range 1 to 4 the function should return ['a','b','c','d']. +Write a function to generate an array of lower case ASCII characters for a given range. For example, given the range ['a', 'd'], the function should return ['a', 'b', 'c', 'd'].
## Instructions @@ -44,7 +44,7 @@ tests:
```js -function lascii (cFrom, cTo) { +function lascii(cFrom, cTo) { // Good luck! } ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/generatorexponential.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/generatorexponential.english.md index 7518879257..a8abc15076 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/generatorexponential.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/generatorexponential.english.md @@ -9,14 +9,13 @@ challengeType: 5 A generator is an executable entity (like a function or procedure) that contains code that yields a sequence of values, one at a time, so that each time you call the generator, the next value in the sequence is provided. Generators are often built on top of coroutines or objects so that the internal state of the object is handled “naturally”. Generators are often used in situations where a sequence is potentially infinite, and where it is possible to construct the next value of the sequence with only minimal state. -Write a function that uses generators to generate squares and cubes. Create a new generator that filters all cubes from the generator of squares. -The function should return the \( n^{th} \) value of the filtered generator. -For example for \(n=7\), the function should return 81 as the sequence would be 4,9,16,25,36,49,81. Here 64 is filtered out, as it is a cube. ## Instructions
- +Write a function that uses generators to generate squares and cubes. Create a new generator that filters all cubes from the generator of squares. +The function should return the \( n^{th} \) value of the filtered generator. +For example for \(n=7\), the function should return 81 as the sequence would be 4, 9, 16, 25, 36, 49, 81. Here 64 is filtered out, as it is a cube.
## Tests @@ -49,7 +48,7 @@ tests:
```js -function exponentialGenerator (n) { +function exponentialGenerator(n) { // Good luck! } ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gray-code.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gray-code.english.md index f057348746..96d8472aff 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gray-code.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/gray-code.english.md @@ -6,21 +6,34 @@ challengeType: 5 ## Description
-Gray code is a form of binary encoding where transitions between consecutive numbers differ by only one bit. +Gray code is a form of binary encoding where transitions between consecutive numbers differ by only one bit. This is a useful encoding for reducing hardware data hazards with values that change rapidly and/or connect to slower hardware as inputs. -It is also useful for generating inputs for Karnaugh maps in order from left to right or top to bottom. -Create a function to encode a number to and decode a number from Gray code. The function should will have 2 parameters. -The first would be a boolean. The function should encode for true and decode for false. The second parameter would be the number to be encoded/decoded. -Display the normal binary representations, Gray code representations, and decoded Gray code values for all 5-bit binary numbers (0-31 inclusive, leading 0's not necessary). -There are many possible Gray codes. The following encodes what is called "binary reflected Gray code."
Encoding (MSB is bit 0, b is binary, g is Gray code): -
if b[i-1] = 1
g[i] = not b[i]
else
g[i] = b[i]
- Or:
g = b xor (b logically right shifted 1 time)
Decoding (MSB is bit 0, b is binary, g is Gray code):
-b[0] = g[0]
for other bits:
b[i] = g[i] xor b[i-1]
 +It is also useful for generating inputs for Karnaugh maps in order from left to right or top to bottom.
## Instructions
- +Create a function to encode a number to and decode a number from Gray code. The function should will have 2 parameters. +The first would be a boolean. The function should encode for true and decode for false. The second parameter would be the number to be encoded/decoded. +Display the normal binary representations, Gray code representations, and decoded Gray code values for all 5-bit binary numbers (0-31 inclusive, leading 0's not necessary). +There are many possible Gray codes. The following encodes what is called "binary reflected Gray code." +Encoding (MSB is bit 0, b is binary, g is Gray code): +
+if b[i-1] = 1
+  g[i] = not b[i]
+else
+  g[i] = b[i]
+
+Or: +
+g = b xor (b logically right shifted 1 time)
+
+Decoding (MSB is bit 0, b is binary, g is Gray code): +
+b[0] = g[0]

+for other bits:
+b[i] = g[i] xor b[i-1]
+
## Tests diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/greatest-subsequential-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/greatest-subsequential-sum.english.md index f17ce447f6..f63624883b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/greatest-subsequential-sum.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/greatest-subsequential-sum.english.md @@ -22,20 +22,20 @@ An empty subsequence is considered to have the sum of \( 0 \); thus if all elem tests: - text: maximumSubsequence should be a function. testString: assert(typeof maximumSubsequence=='function','maximumSubsequence should be a function.'); - - text: maximumSubsequence([1,2,-1,3,10,-10]) should return an array. - testString: assert(Array.isArray(maximumSubsequence([1,2,-1,3,10,-10])),'maximumSubsequence([1,2,-1,3,10,-10]) should return an array.'); - - text: maximumSubsequence([1,2,-1,3,10,-10]) should return [ 1, 2, -1, 3, 10 ]. - testString: assert.deepEqual(maximumSubsequence([1,2,-1,3,10,-10]), [ 1, 2, -1, 3, 10 ],'maximumSubsequence([1,2,-1,3,10,-10]) should return [ 1, 2, -1, 3, 10 ].'); - - text: maximumSubsequence([0, 8, 10, -2, -4, -1, -5, -3]) should return [ 0, 8, 10 ]. - testString: assert.deepEqual(maximumSubsequence([0, 8, 10, -2, -4, -1, -5, -3]), [ 0, 8, 10 ],'maximumSubsequence([0, 8, 10, -2, -4, -1, -5, -3]) should return [ 0, 8, 10 ].'); - - text: maximumSubsequence([9, 9, -10, 1]) should return [ 9, 9 ]. - testString: assert.deepEqual(maximumSubsequence([9, 9, -10, 1]), [ 9, 9 ],'maximumSubsequence([9, 9, -10, 1]) should return [ 9, 9 ].'); - - text: maximumSubsequence([7, 1, -5, -3, -8, 1] should return [ 7, 1 ]. - testString: assert.deepEqual(maximumSubsequence([7, 1, -5, -3, -8, 1]), [ 7, 1 ],'maximumSubsequence([7, 1, -5, -3, -8, 1] should return [ 7, 1 ].'); - - text: maximumSubsequence([-3, 6, -1, 4, -4, -6]) should return [ 6, -1, 4 ]. - testString: assert.deepEqual(maximumSubsequence([-3, 6, -1, 4, -4, -6]), [ 6, -1, 4 ],'maximumSubsequence([-3, 6, -1, 4, -4, -6]) should return [ 6, -1, 4 ].'); - - text: maximumSubsequence([-1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1]) should return [ 3, 5, 6, -2, -1, 4 ]. - testString: assert.deepEqual(maximumSubsequence([-1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1]), [ 3, 5, 6, -2, -1, 4 ],'maximumSubsequence([-1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1]) should return [ 3, 5, 6, -2, -1, 4 ].'); + - text: maximumSubsequence([ 1, 2, -1, 3, 10, -10 ]) should return an array. + testString: assert(Array.isArray(maximumSubsequence([ 1, 2,-1, 3, 10, -10 ])),'maximumSubsequence([ 1, 2, -1, 3, 10, -10 ]) should return an array.'); + - text: maximumSubsequence([ 1, 2, -1, 3, 10, -10 ]) should return [ 1, 2, -1, 3, 10 ]. + testString: assert.deepEqual(maximumSubsequence([1,2,-1,3,10,-10]), [ 1, 2, -1, 3, 10 ],'maximumSubsequence([ 1, 2, -1, 3, 10, -10 ]) should return [ 1, 2, -1, 3, 10 ].'); + - text: maximumSubsequence([ 0, 8, 10, -2, -4, -1, -5, -3 ]) should return [ 0, 8, 10 ]. + testString: assert.deepEqual(maximumSubsequence([0, 8, 10, -2, -4, -1, -5, -3]), [ 0, 8, 10 ],'maximumSubsequence([ 0, 8, 10, -2, -4, -1, -5, -3 ]) should return [ 0, 8, 10 ].'); + - text: maximumSubsequence([ 9, 9, -10, 1 ]) should return [ 9, 9 ]. + testString: assert.deepEqual(maximumSubsequence([ 9, 9, -10, 1 ]), [ 9, 9 ],'maximumSubsequence([ 9, 9, -10, 1 ]) should return [ 9, 9 ].'); + - text: maximumSubsequence([ 7, 1, -5, -3, -8, 1 ] should return [ 7, 1 ]. + testString: assert.deepEqual(maximumSubsequence([ 7, 1, -5, -3, -8, 1 ]), [ 7, 1 ],'maximumSubsequence([ 7, 1, -5, -3, -8, 1 ] should return [ 7, 1 ].'); + - text: maximumSubsequence([ -3, 6, -1, 4, -4, -6 ]) should return [ 6, -1, 4 ]. + testString: assert.deepEqual(maximumSubsequence([ -3, 6, -1, 4, -4, -6 ]), [ 6, -1, 4 ],'maximumSubsequence([ -3, 6, -1, 4, -4, -6 ]) should return [ 6, -1, 4 ].'); + - text: maximumSubsequence([ -1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1 ]) should return [ 3, 5, 6, -2, -1, 4 ]. + testString: assert.deepEqual(maximumSubsequence([ -1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1 ]), [ 3, 5, 6, -2, -1, 4 ],'maximumSubsequence([ -1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1 ]) should return [ 3, 5, 6, -2, -1, 4 ].'); ``` @@ -47,7 +47,7 @@ tests:
```js -function maximumSubsequence (population) { +function maximumSubsequence(population) { // Good luck! } ``` @@ -87,8 +87,6 @@ function maximumSubsequence(population) { return greatest; } - - ```