In this chapter, we learned about the queue data structure. We implemented our own algorithm that represents a queue, and we learned how to add and remove elements from it using the enqueue and dequeue methods following the FIFO principle. We also learned about the deque data structure, how to add elements to the front and the back of the deque, and how to remove elements from the front or the back of the deque.
We also covered how to solve two famous problems using the queue and deque data structures: the Hot Potato game (using a modified queue: the circular queue) and a palindrome checker using a deque.
In the next chapter, we will learn about linked lists, a dynamic and more complex data structure.