Check If A String Is A Palindrome | C++ Example

[@rupertzoone3512]

Clear and smooth explanation with good example.

[@PortfolioCourses]

Thank you for the kind feedback Rupert. :-)

[@88NA]

this example is very well explained. thank you.

[@PortfolioCourses]

You're welcome, I'm glad you enjoyed it! :-)

[@asthagothi7151]

The only explanation i needed

[@carsmiles4035]

Thank you so much for going into details! It is extremely helpful!

[@abugslife2461]

Very helpful! Thank you so much!

[@rakshithgowdahc9250]

here in if statement can u explain the indexing how we did it?? because if text length is 10-1-1==8,how we are comparing is it the correct way what I calculated

[@PortfolioCourses]

Great question Rakshith! Remember that i starts off at 0. So if the length is 10 then we get 10 - 1 - i which is 10 - 1 - 0 which is then 9. And that would mean we are comparing the element at index 0 with the element at index 9, which is exactly what we want because (due to zero-indexing) the last char in the string will be at index 9. :-)

[@sazzadhossen32]

very good and clear explaination

[@christosvrettos8257]

Great explanatory video!!

[@PortfolioCourses]

Thank you very much Christos, I'm glad you enjoyed it! :-)

[@Vichained]

Hey Kevin, could you do this exact examply but using stack allocation and vectors?

[@PortfolioCourses]

I'm not sure, maybe one day! 🙂

[@HowDoYouTurnThisOn_]

which line of code checks if the two characters are the same?

[@musicoomi]

if (palindrome[i] != palindrome[palindrome.length() - i - 1])

[@fovv3783]

couldn't you add another empty string, then with for loop from back add reversed text to this empty string and then check if they are equal? I mean it is working in c# and i am not sure if you can do this in c++.

[@PortfolioCourses]

Yes, it sounds like that approach would work too! :-)

[@worst1133]

Thanks 😊

[@urruuu8447]

why did the text.length got divided by 2?

[@PortfolioCourses]

Great question Urishita! 🙂 We want to compare the 1st element to the last element, the 2nd element to the 2nd last element and so on to see if all of the corresponding elements match. So we really only need our loop counter variable to go until the middle of the string. Once we reach the middle of the string, we will have compared the 1st element to the last, the 2nd element to the 2nd last element, and so on. We could go keep past the middle of the string, but we would just end up making the same comparisons again, so for example by the last run of the loop we would just e comparing the last element to the 1st element again. We save work by only checking up until the middle of the string as that is all that is required. 🙂

[@urruuu8447]

@@PortfolioCourses okayy thank youu so much for your reply

[@PortfolioCourses]

You’re welcome! :-)

[@merveilleuxguiradoumadji290]

thank you so much,that was very hard for me .

[@PortfolioCourses]

You're welcome Merveilleux! 😀

[@abdelhakmezenner2855]

damn that was in my last exam of c programming 😂 it was so hard for me .. but now its a little bit easier

[@PortfolioCourses]

I’m glad to hear this made it a bit easier Abdelhak! :-)

[@gokulakrishnan9141]

Love you sooo much man❤

[@PortfolioCourses]

Haha thanks, love you right back ❤️

[@waed5893]

Thank you for video 👏 But if you can make video to check if we can make number palindrome after swaping their digits.

[@PortfolioCourses]

Thank you for the video idea Waed, I will add that idea to my list of video ideas. :-)

[@alexandrstrekalovskiy4083]

Many thanks for video!

[@PortfolioCourses]

You're welcome Alexandr! :-)

[@alshaimaahassan3512]

Many thanks for video

[@PortfolioCourses]

You're welcome Alshaimaa! :-)

[@yodakash6284]

fake!!!!!!

[@PortfolioCourses]

What? :-)