diff --git a/README.md b/README.md
index b56e503d5..5d3c89d81 100644
--- a/README.md
+++ b/README.md
@@ -74,8 +74,7 @@ Base cases are for string `length` equal to `2` or `1`.
 const anagrams = str => {
   if(str.length <= 2)  return str.length === 2 ? [str, str[1] + str[0]] : [str];
   return str.split('').reduce( (acc, letter, i) => {
-    anagrams(str.slice(0, i) + str.slice(i + 1)).map( val => acc.push(letter + val) );
-    return acc;
+    return acc.concat(anagrams(str.slice(0, i) + str.slice(i + 1)).map( val => letter + val ));
   }, []);
 }
 // anagrams('abc') -> ['abc','acb','bac','bca','cab','cba']
diff --git a/snippets/anagrams-of-string-(with-duplicates).md b/snippets/anagrams-of-string-(with-duplicates).md
index 0d24e51cb..10b949654 100644
--- a/snippets/anagrams-of-string-(with-duplicates).md
+++ b/snippets/anagrams-of-string-(with-duplicates).md
@@ -8,10 +8,8 @@ Base cases are for string `length` equal to `2` or `1`.
 ```js
 const anagrams = str => {
   if(str.length <= 2)  return str.length === 2 ? [str, str[1] + str[0]] : [str];
-  return str.split('').reduce( (acc, letter, i) => {
-    anagrams(str.slice(0, i) + str.slice(i + 1)).map( val => acc.push(letter + val) );
-    return acc;
-  }, []);
+  return str.split('').reduce( (acc, letter, i) =>
+    acc.concat(anagrams(str.slice(0, i) + str.slice(i + 1)).map( val => letter + val )), []);
 }
 // anagrams('abc') -> ['abc','acb','bac','bca','cab','cba']
 ```