1. Queue Basics
·      Implement a Queue Using Arrays
·      Implement a Queue Using Linked Lists
·      Implement a Circular Queue
·      Implement a Double-Ended Queue (Deque)
·      Implement a Queue Using Two Stacks
·      Implement a Stack Using Two Queues
·      Implementing a Queue Using Recursion
·      Circular Tour Problem (Petrol Pump Problem)
·      Generate Binary Numbers from 1 to N Using a Queue
·      Reverse the First K Elements of a Queue
 
 2. Advanced Queue Implementations
·      Implement a Priority Queue
·      Implement a Min Priority Queue
·      Implement a Max Priority Queue
·      Implement a Queue with Dynamic Resizing
·      Design a Queue with Increment Operation
·      Implement a Queue Using a Doubly Linked List
·      Implement a Monotonic Queue
·      LRU Cache Implementation Using Queue
·      Implement a Queue to Support Middle Element Access
·      Implement Queue Sorting Using Recursion
 
 3. Queue Problem Solving
·      First Non-Repeating Character in a Stream
·      Sliding Window Maximum
·      Sliding Window Minimum
·      Rotten Oranges (Time to Rot All Oranges)
·      Interleave the First Half of the Queue with the Second Half
·      Implement a Circular Buffer
·      Implement a Custom Queue with Customized Push/Pop Rules
·      Check if a Given Sequence of Operations is Valid for a Queue
·      Finding the Maximum in Every Window of Size K
·      Design a Queue That Supports GetMin and GetMax in O(1) Time
 
 5. Queue and Recursion
·      Reverse a Queue Using Recursion
·      Sort a Queue Using Recursion
·      Interleave Two Queues Recursively
·      Merge Two Sorted Queues Using Recursion
·      Recursively Insert an Element at the Rear of a Queue
·      Implement a Recursive BFS for Tree Traversal
·      Recursively Reverse First K Elements in a Queue
·      Flattening a Queue of Queues
·      Recursive Sliding Window Maximum Using Queue
·      Implement Recursive Depth Calculation Using Queue