```js
-function sumsq (array) {
+function sumsq(array) {
// Good luck!
}
```
@@ -54,7 +54,7 @@ function sumsq (array) {
```js
-function sumsq (array) {
+function sumsq(array) {
var sum = 0;
var i, iLen;
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sum-to-100.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sum-to-100.md
index cc5471e3cb0..7d4dbae9a0c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sum-to-100.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sum-to-100.md
@@ -10,12 +10,11 @@ Find solutions to the sum to one hundred puzzle.
Add (insert) the mathematical operators + or ─ (plus or minus) before any of the digits in the decimal numeric string 123456789 such that the resulting mathematical expression adds up to a particular sum (in this iconic case, 100).
Example:
123 + 4 - 5 + 67 - 89 = 100
-Write a function that takes a number as parameter. The function should return an array containing all solutions for the given number. The solutions should be strings representing the expressions. For example: "1+23-456+78-9". Note: sort the array before returning it.
## Instructions
-
+Write a function that takes a number as parameter. The function should return an array containing all solutions for the given number. The solutions should be strings representing the expressions. For example: "1+23-456+78-9". Sort the array before returning it.
## Tests
@@ -25,8 +24,8 @@ Write a function that takes a number as parameter. The function should return an
tests:
- text:
sumTo100 should be a function.
testString: assert(typeof sumTo100 == 'function', '
sumTo100 should be a function.');
- - text:
sumTo100(199) should return a array.
- testString: assert(Array.isArray(sumTo100(199)), '
sumTo100(199) should return a array.');
+ - text:
sumTo100(199) should return an array.
+ testString: assert(Array.isArray(sumTo100(199)), '
sumTo100(199) should return an array.');
- text:
sumTo100(199) should return
["-1+2-3+45+67+89", "123-4+5+6+78-9", "123-4+56+7+8+9"].
testString: assert.deepEqual(sumTo100(199), ["-1+2-3+45+67+89", "123-4+5+6+78-9", "123-4+56+7+8+9"], '
sumTo100(199) should return
["-1+2-3+45+67+89", "123-4+5+6+78-9", "123-4+56+7+8+9"].');
- text:
sumTo100(209) should return
["1+234+56+7-89"].
@@ -46,7 +45,7 @@ tests:
```js
-function sumTo100 (n) {
+function sumTo100(n) {
// Good luck!
}
```
@@ -58,7 +57,7 @@ function sumTo100 (n) {
```js
-function sumTo100 (n) {
+function sumTo100(n) {
var permutationsWithRepetition = function(n, as) {
return as.length > 0 ?
foldl1(curry(cartesianProduct)(as), replicate(n, as)) : [];
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
index 1cde765c849..abed0c58f0c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
@@ -6,18 +6,17 @@ challengeType: 5
## Description
-The Sutherland-Hodgman clipping algorithm finds the polygon that is the intersection between an arbitrary polygon (the “subject polygon”) and a convex polygon (the “clip polygon”).
+The Sutherland-Hodgman clipping algorithm finds the polygon that is the intersection between an arbitrary polygon (the “subject polygon”) and a convex polygon (the “clip polygon”).
It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed.
Take the closed polygon defined by the points:
-$[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]$
+[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]
and clip it by the rectangle defined by the points:
-$[(100, 100), (300, 100), (300, 300), (100, 300)]$
-Write a function that takes 2 arrays as parameters. The first array contains the points of the subject polygon and the second array contains the points of the clipping polygon. The function should return an array containing the points of the clipped polygon. Each number should be rounded to 3 decimal places.
+[(100, 100), (300, 100), (300, 300), (100, 300)]
## Instructions
-
+Write a function that takes 2 arrays as parameters. The first array contains the points of the subject polygon and the second array contains the points of the clipping polygon. The function should return an array containing the points of the clipped polygon. Each number should be rounded to 3 decimal places.
## Tests
@@ -27,8 +26,8 @@ Write a function that takes 2 arrays as parameters. The first array contains the
tests:
- text: clip should be a function.
testString: assert(typeof clip == 'function', 'clip should be a function.');
- - text: clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]]) should return a array.
- testString: assert(Array.isArray(clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]])), 'clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]]) should return a array.');
+ - text: clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]]) should return an array.
+ testString: assert(Array.isArray(clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]])), 'clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]]) should return an array.');
- text: clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]]) should return [[100, 116.667], [125, 100], [275, 100], [300, 116.667], [300, 300], [250, 300], [200, 250], [175, 300], [125, 300], [100, 250]].
testString: assert.deepEqual(clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]]), [[100, 116.667], [125, 100], [275, 100], [300, 116.667], [300, 300], [250, 300], [200, 250], [175, 300], [125, 300], [100, 250]], 'clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]]) should return [[100, 116.667], [125, 100], [275, 100], [300, 116.667], [300, 300], [250, 300], [200, 250], [175, 300], [125, 300], [100, 250]].');
- text: clip([[150, 200], [400, 450], [30, 50]], [[10, 10], [300, 200], [400, 600], [100, 300]]) should return [[150, 200], [350, 400], [348.611, 394.444], [30, 50]].
@@ -44,7 +43,7 @@ tests:
```js
-function clip (subjectPolygon, clipPolygon) {
+function clip(subjectPolygon, clipPolygon) {
// Good luck!
}
```
@@ -56,7 +55,7 @@ function clip (subjectPolygon, clipPolygon) {
```js
-function clip (subjectPolygon, clipPolygon) {
+function clip(subjectPolygon, clipPolygon) {
var cp1, cp2, s, e, i, j;
var inside = function(p) {
return (cp2[0] - cp1[0]) * (p[1] - cp1[1]) > (cp2[1] - cp1[1]) * (p[0] - cp1[0]);
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 a98889f1fb9..8ea2a048c4e 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,15 +6,14 @@ challengeType: 5
## Description
-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.
+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).
-Write a function that takes two arrays as parameters and returns the symmetric difference. Note: Sort the resultant array before returning it.
## Instructions
-
+Write a function that takes two arrays as parameters and returns the symmetric difference. Sort the resultant array before returning it.
## Tests
@@ -24,8 +23,8 @@ Write a function that takes two arrays as parameters and returns the symmetric d
tests:
- text: symmetricDifference should be a function.
testString: assert(typeof symmetricDifference == 'function', 'symmetricDifference should be a function.');
- - text: symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"]) should return a array.
- testString: assert(Array.isArray(symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])), 'symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"]) should return a array.');
+ - text: symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"]) should return an array.
+ testString: assert(Array.isArray(symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])), 'symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"]) should return an array.');
- text: symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"]) should return ["Jim", "Serena"].
testString: assert.deepEqual(symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"]), ["Jim", "Serena"], 'symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"]) should return ["Jim", "Serena"].');
- text: symmetricDifference([1, 2, 3], [3, 4]) should return [1, 2, 4].
@@ -45,7 +44,7 @@ tests:
```js
-function symmetricDifference (A, B) {
+function symmetricDifference(A, B) {
// Good luck!
}
```
@@ -57,7 +56,7 @@ function symmetricDifference (A, B) {
```js
-function symmetricDifference (A, B) {
+function symmetricDifference(A, B) {
function relative_complement(A, B) {
return A.filter(function(elem) {
return B.indexOf(elem) == -1