Continuing the discussion from avaScript Algorithms and Data Structures Projects: Palindrome Checker #2:
Hey, I’m just checking and asking. In this exercise, the user are supposed to write an algorithm to check if it’s a palindrome. But this user did not do that, but TRIED to bypass it just by trying to get all the statement correct. Here’s his code that I corrected: (spoiler)
function palindrome(str) {
if (str=="eye") return true;
if (str == "_eye") return true;
if (str =="race car") return true;
if (str == "not a palindrome") return false;
if (str == "A man, a plan, a canal. Panama") return true;
if (str == "never odd or even") return true;
if (str == "nope") return false;
if (str == "almostmola") return false;
if (str == "My age is 0, 0 si ega ym.") return true;
if (str== "1 eye for of 1 eye.") return false;
if (str == "0_0 (: /-\ :) 0-0") return true;
if (str == "five|\_/|four") return false;
var str = [];
for (i=0; i<str.length; i++) {
str.join([0,1], [1,0])
}
}
console.log(palindrome("eye"));
This will solve the challenge, but not using an algorithm. Is this okay for the curicullum, or is there a way to prevent this, or is it just fine to do this (which I think is not).