Day 18: Queues and Stacks - HackerRank 30 days of code solution
Welcome to Day 18! Today we're learning about Stacks and Queues. A palindrome is a word, phrase, number, or other sequence of characters which reads the same backwards and forwards. Can you determine if a given string, , is a palindrome? To solve this challenge, we must first take each character in , enqueue it in a queue , and also push that same character onto a stack . Once that's done, we must dequeue the first character from the queue and pop the top character off the stack , then compare the two characters to see if they are the same; as long as the characters match, we continue dequeueing, popping, and comparing each character until our containers are empty (a non-match means isn't a palindrome). Write the following declarations and implementations: Two instance variables: one for your , and one for your . A void pushCharacter(char ch) ...