JS Interview - Palindromes - Question 17

[@DmitriyMalayevProfile]

My favorite KZbin Professor. Intelligent, Educated, and Humane.

[@princejaiswal439]

Love the way you explain things..Thanks a lot for this entire series.

[@ylexisbutler8066]

You are a life saver and an incredible teacher. Thank you

[@pablitoengineer]

Thanks for the Video! I was wondering if you need the lines 8, 9, 10. I think it works only reversing the entire word, storging the result in a "reversed" variable, and return "word === reversed". Does that make sense?

[@Optimized_Finance.]

Awesome, please do linked list, your teaching is magnanimous.

[@ubermensch-mne]

Why don't you just write: return word === word.split('').reverse().join('');

[@SteveGriffith-Prof3ssorSt3v3]

You definitely could do that. Sometimes I just break things up into extra steps to improve readability or to let people who are less experienced understand it better.

[@sergeyb6071]

this actually evaluates to false if a palindrome is a phrase

[@aleksamitic6655]

Did the same thing.

[@xXESproductionsXx]

Interviewers would probably like to see something more complex than using built-ins.

[@Zonab360]

@@xXESproductionsXx Not nesciarly. Companies also want people who can utilize tools. If I had this question I would do the built in methods and if they push back then use another method

[@iali3903]

I try to solve all problems without using any native function like "reverse" in this problem! this is my solution using for Loop let wordArr = word.split(""); let revArr = []; let wordRev; for (let i = wordArr.length - 1; i >= 0; i--) { revArr.push(wordArr[i]); } wordRev = revArr.join(""); return word == wordRev;

[@lastnamefirstname2390]

I'm gonna like every single one of these videos. Amazing.

[@nav0110]

It was really helpful for me because I'm new in JS. Thank you...!

[@braca86]

let palindrome = function (word) { const reverse = word.split("").reverse().join(""); return word === reverse; };

[@maxnag-dev]

you forgot about Case of letters

[@braca86]

@maxnag-dev you are right. just chime in some toLowerCase

[@giorgilomaia1623]

Hello, I just found your youtube channel and I think it's very helpful, can you please make video about how to turn JS array, where all the integers are numbers into Palindrome? Thanks in advance .

[@artvizi]

What are the time and space complexity of this algorithm?

[@priyankajamwal994]

Thanku so much u did such a great work 👍👍. I got it each and every step very clearly 😊

[@harshverma3882]

how to take inputs from users??

[@JohnDoe-rj2kf]

Dear Steve, so the point of Math.floor is to remove the uneven number in the middle to help with the equal division and better reverse checking. Am I right?

[@SteveGriffith-Prof3ssorSt3v3]

floor is to get rid of the possible decimal value you can get dividing an even number by two. There can't be an index number in an array like [3.5]

[@Endorsun]

Dude... THANK YOU!

[@rupbhaiya]

Why not this? function palindrome(str) { const gotStr = str.toLowerCase() const revStr = gotStr.split("").reverse().join("") return gotStr === revStr } console.log(palindrome("eye"))

[@guyzohar3756]

I did it this way: function palindrome(word){ for(let i = 0; i < word.length; i++){ const last = word.length-1 if( word.length % 2 !== 0 && (i === last - i) ) continue; if( word.charAt(i) !== word.charAt(last - i) ) return false } return true } I think its a bit more efficient no?

[@Bruno-ds8ze]

great tutorial

[@fadiserapian1360]

const isPalindrom = str => str === str.split('').reverse().join('');

[@Banjer]

Great!!Thanks

[@abhishekkumar2526]

Nice try but it won't work for "A man, a plan, a canal: Panama"

[@SteveGriffith-Prof3ssorSt3v3]

That's not a valid palindrome

[@abhishekkumar2526]

@@SteveGriffith-Prof3ssorSt3v3 check it over here www.willpeavy.com/palindrome/

[@SteveGriffith-Prof3ssorSt3v3]

@@abhishekkumar2526 I am not removing punctuation in this demo.

[@maksymantoshkin2896]

Awesome

[@71sux]

another approach: palindrome === Array.of(palindrome).reverse();

[@Serjgap]

that fcking start=

[@SteveGriffith-Prof3ssorSt3v3]

what?

[@arunputhiyidath]

return word === word.split('').reverse().join(''); // is the best I think