fix(curriculum): clean-up Project Euler 361-380 (#43002)

* fix: clean-up Project Euler 361-380

* fix: improve wording

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>

* fix: remove unnecessary paragraph

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-369-badugi.md

@@ -10,16 +10,16 @@ dashedName: problem-369-badugi
 
 In a standard 52 card deck of playing cards, a set of 4 cards is a Badugi if it contains 4 cards with no pairs and no two cards of the same suit.
 
-Let f(n) be the number of ways to choose n cards with a 4 card subset that is a Badugi. For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.
+Let $f(n)$ be the number of ways to choose $n$ cards with a 4 card subset that is a Badugi. For example, there are $2\\,598\\,960$ ways to choose five cards from a standard 52 card deck, of which $514\\,800$ contain a 4 card subset that is a Badugi, so $f(5) = 514800$.
 
-Find ∑f(n) for 4 ≤ n ≤ 13.
+Find $\sum f(n)$ for $4 ≤ n ≤ 13$.
 
 # --hints--
 
-`euler369()` should return 862400558448.
+`badugi()` should return `862400558448`.
 
 ```js
-assert.strictEqual(euler369(), 862400558448);
+assert.strictEqual(badugi(), 862400558448);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler369(), 862400558448);
 ## --seed-contents--
 
 ```js
-function euler369() {
+function badugi() {
 
   return true;
 }
 
-euler369();
+badugi();
 ```
 
 # --solutions--