diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations/index.md
index ef89c65dec..f85d80ccd8 100644
--- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations/index.md
+++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations/index.md
@@ -90,4 +90,33 @@ Grab the second string, lowercase and turn it into an array; then make sure _eve
* Array.split()
* Array.every()
-
\ No newline at end of file
+
+
+
+Solution 3 (Click to Show/Hide)
+
+**Declarative**
+
+```js
+function mutation(arr) {
+ for (var el of arr[1]){
+ let re = new RegExp(el,"i");
+ if (re.test(arr[0]) == false){
+ return false;
+ }
+ }
+ return true;
+}
+```
+
+#### Code Explanation
+
+* For every letter of the second Array we want to check if it's in the first array using the test() Method.
+* The RegExp(el,"i") function will create a Regular Expression for every letter. For example RegExp("Hey",i) will create /H/i, then /e/i, then /y/i.
+* If there is one letter that return false, than we return false. If arr[0] contains all letters than we return true.
+
+#### Relevant Links
+
+* RegExp.test()
+
+