Palindrome checker solution in code

- [Narrator] Now I'll show you the code I wrote…to solve this problem.…I knew that I had to use a deque…and I implemented the deque exactly the same way…that we did earlier in the chapter.…So I won't go through that here.…Instead I'll move on to the function itself.…I created a function on line 22 called check_palindrome.…It takes a parameter called input string…and that's the string we want to check…whether or not it's a palindrome.…On line 24 I create my own deque object called…my underscore d and for every character in my input string…I add that character to the rear of the deque.…

This preserves the order of the characters…as they are present in the input string.…On line 28 I start my while loop.…As long as there are at least two items in my deque…I want to continue removing items from each end…and comparing them.…I do that by calling the remove front method…on my deque on line 29,…and store that in a variable called front item.…And I do something very similar on line 30…where I call the remove rear method on my deque object…