diff --git a/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md b/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md index a9f81ecd7df..134359ce86b 100644 --- a/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md +++ b/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md @@ -9,7 +9,7 @@ dashedName: access-multi-dimensional-arrays-with-indexes # --description-- -One way to think of a multi-dimensional array, is as an *array of arrays*. When you use brackets to access your array, the first set of brackets refers to the entries in the outer-most (the first level) array, and each additional pair of brackets refers to the next level of entries inside. +One way to think of a multi-dimensional array, is as an *array of arrays*. When you use brackets to access your array, the first set of brackets refers to the entries in the outermost (the first level) array, and each additional pair of brackets refers to the next level of entries inside. **Example** diff --git a/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/debugging/catch-misspelled-variable-and-function-names.md b/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/debugging/catch-misspelled-variable-and-function-names.md index cdadad85349..52e8b72c2d0 100644 --- a/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/debugging/catch-misspelled-variable-and-function-names.md +++ b/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/debugging/catch-misspelled-variable-and-function-names.md @@ -24,7 +24,7 @@ Check the spelling of the two variables used in the netWorkingCapital calculatio assert(netWorkingCapital === 2); ``` -There should be no instances of mis-spelled variables in the code. +There should be no instances of misspelled variables in the code. ```js assert(!code.match(/recievables/g)); @@ -36,7 +36,7 @@ The `receivables` variable should be declared and used properly in the code. assert(code.match(/receivables/g).length == 2); ``` -There should be no instances of mis-spelled variables in the code. +There should be no instances of misspelled variables in the code. ```js assert(!code.match(/payable;/g)); diff --git a/curriculum/challenges/english/03-front-end-development-libraries/react-and-redux/connect-redux-to-the-messages-app.md b/curriculum/challenges/english/03-front-end-development-libraries/react-and-redux/connect-redux-to-the-messages-app.md index ce25f89ba65..80746f88de5 100644 --- a/curriculum/challenges/english/03-front-end-development-libraries/react-and-redux/connect-redux-to-the-messages-app.md +++ b/curriculum/challenges/english/03-front-end-development-libraries/react-and-redux/connect-redux-to-the-messages-app.md @@ -14,7 +14,7 @@ In the last lesson, the component you connected to Redux was named `Presentation # --instructions-- -The code editor has all the code you've written in this section so far. The only change is that the React component is renamed to `Presentational`. Create a new component held in a constant called `Container` that uses `connect` to connect the `Presentational` component to Redux. Then, in the `AppWrapper`, render the React Redux `Provider` component. Pass `Provider` the Redux `store` as a prop and render `Container` as a child. Once everything is setup, you will see the messages app rendered to the page again. +The code editor has all the code you've written in this section so far. The only change is that the React component is renamed to `Presentational`. Create a new component held in a constant called `Container` that uses `connect` to connect the `Presentational` component to Redux. Then, in the `AppWrapper`, render the React Redux `Provider` component. Pass `Provider` the Redux `store` as a prop and render `Container` as a child. Once everything is set up, you will see the messages app rendered to the page again. # --hints-- diff --git a/curriculum/challenges/english/05-back-end-development-and-apis/managing-packages-with-npm/add-a-description-to-your-package.json.md b/curriculum/challenges/english/05-back-end-development-and-apis/managing-packages-with-npm/add-a-description-to-your-package.json.md index d4f4da4d681..b9cf761fd99 100644 --- a/curriculum/challenges/english/05-back-end-development-and-apis/managing-packages-with-npm/add-a-description-to-your-package.json.md +++ b/curriculum/challenges/english/05-back-end-development-and-apis/managing-packages-with-npm/add-a-description-to-your-package.json.md @@ -10,7 +10,7 @@ dashedName: add-a-description-to-your-package-json The next part of a good package.json file is the `description` field; where a short, but informative description about your project belongs. -If you some day plan to publish a package to npm, this is the string that should sell your idea to the user when they decide whether to install your package or not. However, that’s not the only use case for the description, it’s a great way to summarize what a project does. It’s just as important in any Node.js project to help other developers, future maintainers or even your future self understand the project quickly. +If some day you plan to publish a package to npm, this is the string that should sell your idea to the user when they decide whether to install your package or not. However, that’s not the only use case for the description, it’s a great way to summarize what a project does. It’s just as important in any Node.js project to help other developers, future maintainers or even your future self understand the project quickly. Regardless of what you plan for your project, a description is definitely recommended. Here's an example: diff --git a/curriculum/challenges/english/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md b/curriculum/challenges/english/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md index d793c160a42..451cbd98349 100644 --- a/curriculum/challenges/english/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md +++ b/curriculum/challenges/english/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md @@ -16,7 +16,7 @@ HTTP Strict Transport Security (HSTS) is a web security policy which helps to pr Configure `helmet.hsts()` to use HTTPS for the next 90 days. Pass the config object `{maxAge: timeInSeconds, force: true}`. You can create a variable `ninetyDaysInSeconds = 90*24*60*60;` to use for the `timeInSeconds`. Replit already has hsts enabled. To override its settings you need to set the field "force" to true in the config object. We will intercept and restore the Replit header, after inspecting it for testing. -Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and a SSL/TLS Certificate. +Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and an SSL/TLS Certificate. # --hints-- diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md index a3d1a5bae08..75be9a9d091 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md @@ -12,7 +12,7 @@ This series of challenges will introduce the tree data structure. Trees are an i First, let's describe some common terminology we will encounter with trees. The root node is the top of the tree. Data points in the tree are called nodes. Nodes with branches leading to other nodes are referred to as the parent of the node the branch leads to (the child). Other more complicated familial terms apply as you might expect. A subtree refers to all the descendants of a particular node, branches may be referred to as edges, and leaf nodes are nodes at the end of the tree that have no children. Finally, note that trees are inherently recursive data structures. That is, any children of a node are parents of their own subtree, and so on. The recursive nature of trees is important to understand when designing algorithms for common tree operations. -To begin, we will discuss a particular type of a tree, the binary tree. In fact, we will actually discuss a particular binary tree, a binary search tree. Let's describe what this means. While the tree data structure can have any number of branches at a single node, a binary tree can only have two branches for every node. Furthermore, a binary search tree is ordered with respect to the child subtrees, such that the value of each node in the left subtree is less than or equal to the value of the parent node, and the value of each node in the right subtree is greater than or equal to the value of the parent node. It's very helpful to visualize this relationship in order to understand it better: +To begin, we will discuss a particular type of tree, the binary tree. In fact, we will actually discuss a particular binary tree, a binary search tree. Let's describe what this means. While the tree data structure can have any number of branches at a single node, a binary tree can only have two branches for every node. Furthermore, a binary search tree is ordered with respect to the child subtrees, such that the value of each node in the left subtree is less than or equal to the value of the parent node, and the value of each node in the right subtree is greater than or equal to the value of the parent node. It's very helpful to visualize this relationship in order to understand it better:
diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md index 7bc0d2b1137..935df9d895d 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md @@ -15,8 +15,8 @@ The specific white cell we will be considering is an ellipse with the equation $ The section corresponding to $−0.01 ≤ x ≤ +0.01$ at the top is missing, allowing the light to enter and exit through the hole.
- light beam starting at point (0.0, 10.1), and impacing the mirror at point (1.4, -9.6) - animation with first 10 relfections of the beam + light beam starting at point (0.0, 10.1), and impacting the mirror at point (1.4, -9.6) + animation with first 10 reflections of the beam

The light beam in this problem starts at the point (0.0, 10.1) just outside the white cell, and the beam first impacts the mirror at (1.4, -9.6). diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md index 6714f94d5fc..de23fc8ac86 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md @@ -10,7 +10,7 @@ dashedName: problem-147-rectangles-in-cross-hatched-grids In a 3x2 cross-hatched grid, a total of 37 different rectangles could be situated within that grid as indicated in the sketch. -ways of situating different rectangles wihtin cross-hatched 3x2 grid +ways of situating different rectangles within cross-hatched 3x2 grid There are 5 grids smaller than 3x2, vertical and horizontal dimensions being important, i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following number of different rectangles could be situated within those smaller grids: diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md index ad8cad6ae02..2788c2ec33e 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md @@ -16,7 +16,7 @@ For this problem, we consider only rectangular rooms with integer dimensions $a$ There is one rule to follow when laying out tatami: there must be no points where corners of four different mats meet. For example, consider the two arrangements below for a 4×4 room: -two arragements of mats in 4x4 room +two arrangements of mats in 4x4 room The arrangement on the left is acceptable, whereas the one on the right is not: a red "X" in the middle, marks the point where four tatami meet. diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md index 2266fd3a7af..8d6523f846b 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md @@ -18,7 +18,7 @@ Although not allowed, but to get an idea if this is anything better: if you plac However, if you cut off from the square four triangles with sides 75 m, 75 m and $75\sqrt{2}$ m the total area becomes 238750 $\text{m}^2$ and the perimeter becomes $1400 + 300\sqrt{2}$ m. So this gives an $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio of 130.87, which is significantly better. -picture showing difference in encosed-area between circle and square with cut off four triangles +picture showing difference in enclosed-area between circle and square with cut off four triangles Find the maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio. Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk. diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md index 44541830f9b..10194d3fddf 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md @@ -12,7 +12,7 @@ In Plato's heaven, there exist an infinite number of bowls in a straight line. E For example, consider two adjacent bowls containing 2 and 3 beans respectively, all other bowls being empty. The following eight moves will finish the game: -animation of game when two adjacent bowls contains 2 and 3 beans respectivelly +animation of game when two adjacent bowls contain 2 and 3 beans respectively You are given the following sequences: diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md index aef1ea66857..62312fa1428 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md @@ -10,7 +10,7 @@ dashedName: problem-385-ellipses-inside-triangles For any triangle $T$ in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside $T$. -ellipse completely insisde of triangle +ellipse completely inside a triangle For a given $n$, consider triangles $T$ such that: diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/align-columns.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/align-columns.md index 85a1d0265f1..ad0b7acd1cd 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/align-columns.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/align-columns.md @@ -38,7 +38,7 @@ const testText = [ - The minimum space between columns should be computed from the text and not hard-coded. - It is not a requirement to add separating characters between or around columns. -For example, one of the lines from the `testText`, after jusitifing to the right, left and center respectivelly: +For example, one of the lines from the `testText`, after justifying to the right, left and center respectively: ```js ' column are separated by at least one space.\n' diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md index 772c6fb9da1..12b5b68cd57 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md @@ -23,7 +23,7 @@ Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$ # --instructions-- -When writing your function, assume the input is an ordered array of all inclusive numbers. +When writing your function, assume the input is an ordered array of all-inclusive numbers. For the answer, please output an object in the following format: diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md index 0ae699eca5b..9c1ade13c16 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md @@ -8,7 +8,7 @@ dashedName: compare-a-list-of-strings # --description-- -A list is a ordered set of values that may contain duplicates. Here is an example: +A list is an ordered set of values that may contain duplicates. Here is an example: ```js const list = [['AA', 'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']]; diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/count-the-coins.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/count-the-coins.md index 3e75b21eac4..bf1d4eac68c 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/count-the-coins.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/count-the-coins.md @@ -46,7 +46,7 @@ assert(typeof countCoins === 'function'); assert.equal(countCoins(15), 6); ``` -`countCoins(85)` shouls return `163`. +`countCoins(85)` should return `163`. ```js assert.equal(countCoins(85), 163); diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sha-256.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sha-256.md index a607324d77e..68894b5a985 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sha-256.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sha-256.md @@ -13,7 +13,7 @@ Meaning `SHA-1` provides a shorter code with fewer possibilities for unique comb # --instructions-- -Research implemenation details and write a function that takes a string as the parameter and returns a hash using `SHA-256` +Research implementation details and write a function that takes a string as the parameter and returns a hash using `SHA-256` # --hints-- diff --git a/curriculum/challenges/english/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md b/curriculum/challenges/english/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md index 51255e5a7d5..8dd028cc0c2 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md +++ b/curriculum/challenges/english/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md @@ -12,11 +12,11 @@ Build a full stack JavaScript app that is functionally similar to this: 0 || htmlSourceAttr.length > 0); equations:

y = 3x | y - 6 = x A system of equations IS solvable, but it is a multi-step process. To - get started, we need to chose a variable we are solving for. Let's + get started, we need to choose a variable we are solving for. Let's solve for "x" first. From the second equation, we know that "x" equals "y - 6", but we cannot simplify that further because we do not have a value for "y". Except, thanks to the system of equations, we DO have a