diff --git a/README.md b/README.md
index 26a3233df..ddd428064 100644
--- a/README.md
+++ b/README.md
@@ -176,8 +176,10 @@ Convert string `toLowerCase()` and use `replace()` to remove non-alphanumeric ch
 Then, `split('')` into individual characters, `reverse()`, `join('')` and compare to the original, unreversed string, after converting it `tolowerCase()`.
 
 ```js
-const palindrome = str =>
-  str.toLowerCase().replace(/[\W_]/g,'').split('').reverse().join('') === str.toLowerCase().replace(/[\W_]/g,'');
+const palindrome = str => {
+  const s = str.toLowerCase().replace(/[\W_]/g,'');
+  return s === s.split('').reverse().join('');
+}
 // palindrome('taco cat') -> true
  ```
 
diff --git a/snippets/check-for-palindrome.md b/snippets/check-for-palindrome.md
index bd0452cf8..a22007688 100644
--- a/snippets/check-for-palindrome.md
+++ b/snippets/check-for-palindrome.md
@@ -4,7 +4,9 @@ Convert string `toLowerCase()` and use `replace()` to remove non-alphanumeric ch
 Then, `split('')` into individual characters, `reverse()`, `join('')` and compare to the original, unreversed string, after converting it `tolowerCase()`.
 
 ```js
-const palindrome = str =>
-  str.toLowerCase().replace(/[\W_]/g,'').split('').reverse().join('') === str.toLowerCase().replace(/[\W_]/g,'');
+const palindrome = str => {
+  const s = str.toLowerCase().replace(/[\W_]/g,'');
+  return s === s.split('').reverse().join('');
+}
 // palindrome('taco cat') -> true
  ```