From 40ad37b0af4e709648aea1dd1604a10b0aca4a5b Mon Sep 17 00:00:00 2001 From: Clement Galidie Date: Mon, 25 Nov 2019 12:28:06 +0100 Subject: [PATCH 1/2] fix optimized solution --- Beginner/palindromeChecker/index-SOLUTION.js | 37 +++++++++++--------- 1 file changed, 20 insertions(+), 17 deletions(-) diff --git a/Beginner/palindromeChecker/index-SOLUTION.js b/Beginner/palindromeChecker/index-SOLUTION.js index 613ca06..e136076 100644 --- a/Beginner/palindromeChecker/index-SOLUTION.js +++ b/Beginner/palindromeChecker/index-SOLUTION.js @@ -1,36 +1,39 @@ // AN INTUITIVE APPROACH -function palindromeChecker(text) { +function palindromeChecker (text) { - var reversedText = text.toLowerCase() + var reversedText = text.toLowerCase() .split('').reverse().join('') - return text === reversedText + return text === reversedText } // LOOPING THROUGH AND COMPARING CHARACTERS -function palindromeChecker(text) { - let charArray = text.toLowerCase().split('') +function palindromeChecker (text) { + let charArray = text.toLowerCase().split('') - let result = charArray.every((letter, index) => { - return letter === charArray[charArray.length - index - 1]; - }) + let result = charArray.every((letter, index) => { + return letter === charArray[charArray.length - index - 1] + }) - return result + return result } // LOOPING THROUGH AND COMPARING CHARACTERS(OPTIMIZED) -function palindromeChecker(text) { - var textLen = text.length; - for (var i = 0; i < textLen / 2; i++) { - if (text[i] !== text[textLen - 1 - i]) { - return false; - } +function palindromeChecker (text) { + const textLowered = text.toLowerCase() + const textLen = text.length + + for (let i = 0; i < textLen / 2; i++) { + if (textLowered[i] !== textLowered[textLen - i - 1]) { + return false } - return true; -} \ No newline at end of file + } + + return true +} From 9b0706e41d63a41a502e2273ed6a8659afc2a352 Mon Sep 17 00:00:00 2001 From: Clement Galidie Date: Mon, 25 Nov 2019 12:38:58 +0100 Subject: [PATCH 2/2] fix code syntax --- Beginner/palindromeChecker/index-SOLUTION.js | 34 ++++++++++---------- 1 file changed, 17 insertions(+), 17 deletions(-) diff --git a/Beginner/palindromeChecker/index-SOLUTION.js b/Beginner/palindromeChecker/index-SOLUTION.js index e136076..58fe5e1 100644 --- a/Beginner/palindromeChecker/index-SOLUTION.js +++ b/Beginner/palindromeChecker/index-SOLUTION.js @@ -1,39 +1,39 @@ // AN INTUITIVE APPROACH -function palindromeChecker (text) { +function palindromeChecker(text) { - var reversedText = text.toLowerCase() + var reversedText = text.toLowerCase() .split('').reverse().join('') - return text === reversedText + return text === reversedText } // LOOPING THROUGH AND COMPARING CHARACTERS -function palindromeChecker (text) { - let charArray = text.toLowerCase().split('') +function palindromeChecker(text) { + let charArray = text.toLowerCase().split('') - let result = charArray.every((letter, index) => { - return letter === charArray[charArray.length - index - 1] - }) + let result = charArray.every((letter, index) => { + return letter === charArray[charArray.length - index - 1]; + }) - return result + return result } // LOOPING THROUGH AND COMPARING CHARACTERS(OPTIMIZED) -function palindromeChecker (text) { - const textLowered = text.toLowerCase() - const textLen = text.length +function palindromeChecker(text) { + const textLowered = text.toLowerCase() + const textLen = text.length - for (let i = 0; i < textLen / 2; i++) { - if (textLowered[i] !== textLowered[textLen - i - 1]) { - return false + for (let i = 0; i < textLen / 2; i++) { + if (textLowered[i] !== textLowered[textLen - i - 1]) { + return false + } } - } - return true + return true }