chore(curriculum): change to US spelling maximize (freeCodeCamp#60911)

Author: Giftea

curriculum/challenges/_meta/project-euler-problems-101-to-200/meta.json

@@ -366,7 +366,7 @@
     },
     {
       "id": "5900f42b1000cf542c50ff3d",
-      "title": "Problem 190: Maximising a weighted product"
+      "title": "Problem 190: Maximizing a weighted product"
     },
     {
       "id": "5900f42b1000cf542c50ff3e",

curriculum/challenges/english/18-project-euler/project-euler-problems-101-to-200/problem-190-maximising-a-weighted-product.md

@@ -1,38 +1,38 @@
 ---
 id: 5900f42b1000cf542c50ff3d
-title: 'Problem 190: Maximising a weighted product'
+title: 'Problem 190: Maximizing a weighted product'
 challengeType: 1
 forumTopicId: 301828
 dashedName: problem-190-maximising-a-weighted-product
 ---
 
 # --description--
 
-Let $S_m = (x_1, x_2, \ldots, x_m)$ be the $m$-tuple of positive real numbers with $x_1 + x_2 + \cdots + x_m = m$ for which $P_m = x_1 \times {x_2}^2 \times \cdots \times {x_m}^m$ is maximised.
+Let $S_m = (x_1, x_2, \ldots, x_m)$ be the $m$-tuple of positive real numbers with $x_1 + x_2 + \cdots + x_m = m$ for which $P_m = x_1 \times {x_2}^2 \times \cdots \times {x_m}^m$ is maximized.
 
 For example, it can be verified that $[P_{10}] = 4112$ ([ ] is the integer part function).
 
 Find $\sum {[P_m]}$ for $2 ≤ m ≤ 15$.
 
 # --hints--
 
-`maximisingWeightedProduct()` should return `371048281`.
+`maximizingWeightedProduct()` should return `371048281`.
 
 ```js
-assert.strictEqual(maximisingWeightedProduct(), 371048281);
+assert.strictEqual(maximizingWeightedProduct(), 371048281);
 ```
 
 # --seed--
 
 ## --seed-contents--
 
 ```js
-function maximisingWeightedProduct() {
+function maximizingWeightedProduct() {
 
   return true;
 }
 
-maximisingWeightedProduct();
+maximizingWeightedProduct();
 ```
 
 # --solutions--

curriculum/challenges/english/18-project-euler/project-euler-problems-201-to-300/problem-232-the-race.md

@@ -16,7 +16,7 @@ On Player 2's turn, she chooses a positive integer $T$ and tosses the coin $T$ t
 
 Player 1 goes first. The winner is the first to 100 or more points.
 
-On each turn Player 2 selects the number, $T$, of coin tosses that maximises the probability of her winning.
+On each turn Player 2 selects the number, $T$, of coin tosses that maximizes the probability of her winning.
 
 What is the probability that Player 2 wins?