diff --git a/snippets/stringPermutations.md b/snippets/stringPermutations.md
index d0524fe30..f34d40910 100644
--- a/snippets/stringPermutations.md
+++ b/snippets/stringPermutations.md
@@ -10,7 +10,7 @@ Generates all permutations of a string (contains duplicates).
 - Use `Array.prototype.map()` to combine the letter with each partial permutation.
 - Use `Array.prototype.reduce()` to combine all permutations in one array.
 - Base cases are for `String.prototype.length` equal to `2` or `1`.
-- ⚠️ **WARNING**: This function's execution time increases exponentially with each character. Anything more than 8 to 10 characters will cause your browser to hang as it tries to solve all the different combinations.
+- ⚠️ **WARNING**: The execution time increases exponentially with each character. Anything more than 8 to 10 characters will cause your environment to hang as it tries to solve all the different combinations.
 
 ```js
 const stringPermutations = str => {