Questions

1. Implement a fixed-sized double-ended queue (FixedDeque).
2. Implement a dynamic-sized circular queue.
3. Imagine a situation where lots of people are standing in a queue to enter a temple and the queue gets enqueued by a group of people. Similarly, it gets dequeued by a group of people. So we need to have the enqueue() and dequeue() APIs to support collections instead of just a single element.
4. To enter into a temple, there are three queues and each queue is associated with a ticket system. All of these three queues get served based on their priority. The higher the ticket cost, the higher the priority they get served. Design such a kind of system using a queue that understands priority. The ticket prices are as follows:
   1. Free—the longer queue as more people opt for it
   2. ₹50—A bit shorter queue
   3. ₹100— The Shortest queue
5. Implement a queue...