Palindrome checker solution approach

(tinkly music)…- [Instructor] While there are of course…many approaches you could've taken to solving this problem,…I'll share with you what I decided to do.…I knew that I would have to loop through the input string…and add all of the characters to the rear of the deck…to get them into the deck.…I chose to add each item to the rear of the deck…because adding an item to the rear of the deck…is a constant time operation.…As long as the deck's size is greater than two,…I would remove the front-most item…and the rear-most item from the deck,…and store each of those in their own variables.…

If those two variables aren't equivalent,…I would return false right away.…If the two variables are equivalent though,…then I could proceed to the next pair of items.…If the size of the deck eventually gets to be smaller…than two, meaning there's only one…or zero characters left in the deck,…then I know the string is a palindrome,…and I can return true.…Now let's talk through how I implemented this in code.…