fix: improve test regex to validate disallowed methods that can be bypassed by prototype reassignments and/or otherwise (#38214)

* fix: improve test regex to validate disallowed methods that can be bypassed by prototype reassignments and/or otherwise

* fix: fixing regex pattern

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-bubble-sort.english.md

@@ -31,7 +31,7 @@ tests:
   - text: <code>bubbleSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(bubbleSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>bubbleSort</code> should not use the built-in <code>.sort()</code> method.
-    testString: assert.strictEqual(code.search(/\.sort\(/), -1);
+    testString: assert(!code.match(/\.?[\s\S]*?sort/));
 
 ```
 

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-insertion-sort.english.md

@@ -29,7 +29,7 @@ tests:
   - text: <code>insertionSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(insertionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>insertionSort</code> should not use the built-in <code>.sort()</code> method.
-    testString: assert.strictEqual(code.search(/\.sort\(/), -1);
+    testString: assert(!code.match(/\.?[\s\S]*?sort/));
 
 ```
 

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-merge-sort.english.md

@@ -33,7 +33,7 @@ tests:
   - text: <code>mergeSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(mergeSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>mergeSort</code> should not use the built-in <code>.sort()</code> method.
-    testString: assert.strictEqual(code.search(/\.sort\(/), -1);
+    testString: assert(!code.match(/\.?[\s\S]*?sort/));
 
 ```
 

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-quick-sort.english.md

@@ -30,7 +30,7 @@ tests:
   - text: <code>quickSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>quickSort</code> should not use the built-in <code>.sort()</code> method.
-    testString: assert.strictEqual(code.search(/\.sort\(/), -1);
+    testString: assert(!code.match(/\.?[\s\S]*?sort/));
 
 ```
 

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-selection-sort.english.md

@@ -29,7 +29,7 @@ tests:
   - text: <code>selectionSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(selectionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>selectionSort</code> should not use the built-in <code>.sort()</code> method.
-    testString: assert.strictEqual(code.search(/\.sort\(/), -1);
+    testString: assert(!code.match(/\.?[\s\S]*?sort/));
 
 ```