chore: resolve flagged Crowdin issues (#45442)

* chore: resolve bengali issues

* chore: resolve french issues

* chore: resolve hebrew issues

* chore: resolve persian issues

* chore: resolve portuguese brazilian issues

* chore: resolve russian issues

* chore: resolve spanish issues

* chore: resolve japanese issues

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-107-minimal-network.md

@@ -27,7 +27,7 @@ The same network can be represented by the matrix below.
 
 However, it is possible to optimise the network by removing some edges and still ensure that all points on the network remain connected. The network which achieves the maximum saving is shown below. It has a weight of 93, representing a saving of 243 − 93 = 150 from the original network.
 
-<img class="img-responsive center-block" alt="Network wtih seven vertices and left six edges: AB, BD, CA, DE, DF, EG" src="https://cdn.freecodecamp.org/curriculum/project-euler/minimal-network-2.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="Network with seven vertices and left six edges: AB, BD, CA, DE, DF, EG" src="https://cdn.freecodecamp.org/curriculum/project-euler/minimal-network-2.png" style="background-color: white; padding: 10px;">
 
 Using `network`, an 2D array representing network in matrix form, find the maximum saving which can be achieved by removing redundant edges whilst ensuring that the network remains connected. Vertices not having connection will be represented with `-1`.
 

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md

@@ -22,7 +22,7 @@ By considering the terms in the Fibonacci sequence whose values do not exceed `n
 assert(typeof fiboEvenSum(10) === 'number');
 ```
 
-Your function should return an `even` value.
+Your function should return an even value.
 
 ```js
 assert.equal(fiboEvenSum(10) % 2 === 0, true);

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md

@@ -8,7 +8,7 @@ dashedName: problem-257-angular-bisectors
 
 # --description--
 
-Given is an integer sided triangle $ABC$ with sides $a ≤ b ≤ c$. ($AB = c$, $BC = a$ and $AC = b$).
+Given is an integer sided triangle $ABC$ with sides $a ≤ b ≤ c$ ($AB = c$, $BC = a$ and $AC = b$).
 
 The angular bisectors of the triangle intersect the sides at points $E$, $F$ and $G$ (see picture below).
 

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md

@@ -8,9 +8,7 @@ dashedName: problem-323-bitwise-or-operations-on-random-integers
 
 # --description--
 
-Let $y_0, y_1, y_2, \ldots$ be a sequence of random unsigned 32 bit integers
-
-(i.e. $0 ≤ y_i < 2^{32}$, every value equally likely).
+Let $y_0, y_1, y_2, \ldots$ be a sequence of random unsigned 32 bit integers (i.e. $0 ≤ y_i < 2^{32}$, every value equally likely).
 
 For the sequence $x_i$ the following recursion is given:
 

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-371-licence-plates.md

@@ -14,7 +14,7 @@ While driving to work Seth plays the following game:
 
 Whenever the numbers of two licence plates seen on his trip add to 1000 that's a win.
 
-E.g. `MIC-012` and `HAN-988` is a win and `RYU-500` and `SET-500` too. (as long as he sees them in the same trip).
+E.g. `MIC-012` and `HAN-988` is a win and `RYU-500` and `SET-500` too (as long as he sees them in the same trip).
 
 Find the expected number of plates he needs to see for a win. Give your answer rounded to 8 decimal places behind the decimal point.
 

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md

@@ -19,7 +19,7 @@ In the case of $n = 4$, there are 12 $n$-tuples of integers which satisfy both c
 
 We define $S(t)$ as the sum of the absolute values of the integers in $t$.
 
-For $n = 4$ we can verify that $\sum S(t) = 2087$ for all $n$-tuples t which satisfy both conditions.
+For $n = 4$ we can verify that $\sum S(t) = 2087$ for all $n$-tuples $t$ which satisfy both conditions.
 
 Find $\sum S(t)$ for $n = 7$.
 

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md

@@ -30,7 +30,7 @@ $$\begin{align}
                   &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\}
 \end{align}$$
 
-**Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of t.
+**Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of $t$.
 
 $S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10$
 

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md

@@ -22,7 +22,7 @@ $2 = \varphi + \varphi^{-2}$ and $3 = \varphi^{2} + \varphi^{-2}$
 
 To represent this sum of powers of $\varphi$ we use a string of 0's and 1's with a point to indicate where the negative exponents start. We call this the representation in the phigital numberbase.
 
-So $1 = 1_{\varphi}$, $2 = 10.01_{\varphi}$, $3 = 100.01_{\varphi}$ and $14 = 100100.001001_{\varphi}$. The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not. (the phigital point is not the middle character).
+So $1 = 1_{\varphi}$, $2 = 10.01_{\varphi}$, $3 = 100.01_{\varphi}$ and $14 = 100100.001001_{\varphi}$. The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not (the phigital point is not the middle character).
 
 The sum of the positive integers not exceeding 1000 whose phigital representation is palindromic is 4345.
 

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md

@@ -12,7 +12,7 @@ All square roots are periodic when written as continued fractions and can be wri
 
 $\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$
 
-For example, let us consider $\\sqrt{23}:$:
+For example, let us consider $\\sqrt{23}$:
 
 $\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$
 

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md

@@ -30,7 +30,7 @@ assert(typeof specialPythagoreanTriplet(24) === 'number');
 assert.strictEqual(specialPythagoreanTriplet(24), 480);
 ```
 
-`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000
+`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000.
 
 ```js
 assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120)));