Queue
A queue is first-in, first-out. Enqueue adds at the back and dequeue removes from the front.
Costs
| Category | Data Structure |
| Difficulty | Easy |
| Enqueue | O(1) |
| Dequeue | O(1) |
| Search | O(n) |
Questions
What is Queue?
A queue is first-in, first-out. Enqueue adds at the back and dequeue removes from the front.
Where do I practice it?
DSA Master keeps challenges and progress on the phone. This page is the idea and the costs.