fix: replace h tags (#40750)

Co-authored-by: Randell Dawson <5313213+RandellDawson@users.noreply.github.com>

curriculum/challenges/english/10-coding-interview-prep/rosetta-code/24-game.md

@@ -16,7 +16,7 @@ The aim of the game is to arrange four numbers in a way that when evaluated, the
 
 Implement a function that takes a string of four digits as its argument, with each digit from 1 to 9 (inclusive) with repetitions allowed, and returns an arithmetic expression that evaluates to the number 24. If no such solution exists, return "no solution exists".
 
-<h4><strong>Rules:</strong></h4>
+**Rules:**
 <ul>
   <li> Only the following operators/functions are allowed: multiplication, division, addition, subtraction. </li>
   <li> Division should use floating point or rational arithmetic, etc, to preserve remainders. </li>

curriculum/challenges/english/10-coding-interview-prep/rosetta-code/balanced-brackets.md

@@ -10,8 +10,7 @@ dashedName: balanced-brackets
 
 Determine whether a generated string of brackets is balanced; that is, whether it consists entirely of pairs of opening/closing brackets (in that order), none of which mis-nest.
 
-<h4><strong>Examples:</strong></h4>
-
+**Examples:**
 | Input                     | Output |
 | ------------------------- | ------ |
 | <code>\[]</code>          | true   |

curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hash-join.md

@@ -41,7 +41,7 @@ In pseudo-code, the algorithm could be expressed as follows:
 
 Implement the "hash join" algorithm as a function and demonstrate that it passes the test-case listed below. The function should accept two arrays of objects and return an array of combined objects.
 
-<h4><strong>Input</strong></h4>
+**Input**
 
 <table>
   <tr>
@@ -127,7 +127,7 @@ Implement the "hash join" algorithm as a function and demonstrate that it passes
   </tr>
 </table>
 
-<h4><strong>Output</strong></h4>
+**Output**
 
 | A_age | A_name | B_character | B_nemesis |
 | ----- | ------ | ----------- | --------- |

curriculum/challenges/english/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md

@@ -70,7 +70,7 @@ Obviously the boundary pixels of the image cannot have the full eight neighbours
   <li>Define $B(P1)$ = the number of black pixel neighbours of P1. ( = sum(P2 .. P9) )</li>
 </ul>
 
-<h3>Step 1:</h3>
+**Step 1:**
 
 All pixels are tested and pixels satisfying all the following conditions (simultaneously) are just noted at this stage.
 
@@ -84,7 +84,7 @@ All pixels are tested and pixels satisfying all the following conditions (simult
 
 After iterating over the image and collecting all the pixels satisfying all step 1 conditions, all these condition satisfying pixels are set to white.
 
-<h3>Step 2:</h3>
+**Step 2:**
 
 All pixels are again tested and pixels satisfying all the following conditions are just noted at this stage.
 
@@ -98,7 +98,7 @@ All pixels are again tested and pixels satisfying all the following conditions a
   
 After iterating over the image and collecting all the pixels satisfying all step 2 conditions, all these condition satisfying pixels are again set to white.
 
-<h3>Iteration:</h3>
+**Iteration:**
 
 If any pixels were set in this round of either step 1 or step 2 then all steps are repeated until no image pixels are so changed.