queue

Queue

📖 When to Use

For FIFO operations, BFS, and level-order processing.

⏱ Complexity

• Time: O(1) enqueue/dequeue
• Space: O(N)

---

🔥 LeetCode Problems

Easy

• Implement Queue using Stacks
• Moving Average from Data Stream

Medium

• Sliding Window Maximum
• Design Hit Counter
• Perfect Squares BFS
• Task Scheduler
• Reorganize String

Hard

• Sliding Window Median
• LFU Cache

💬 Discussion: LeetCode Queue Guide