# Introduction To

Queue Data Structure is a collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once a new element is added, all elements that were added before have to be removed before the new element can be removed. Often a peek or front operation is also entered, returning the value of the front element without dequeuing it. A queue is an example of a linear data structure, or more abstractly a sequential collection.

# Course Structure

- Queue | Set 1 (Introduction and Array Implementation)
- Applications of Queue Data Structure
- Priority Queue | Set 1 (Introduction)
- Applications of Priority Queue
- Deque | Set 1 (Introduction and Applications)
- Circular Queue | Set 1 (Introduction and Array Implementation)
- Queue Interface In Java
- LRU Cache Implementation
- Queue | Set 2 (Linked List Implementation)
- How to efficiently implement k Queues in a single array?
- Priority Queue using Linked List
- Implementation of Deque using doubly linked list
- Program for Page Replacement Algorithms | Set 2 (FIFO)
- ZigZag Tree Traversal
- FIFO (First-In-First-Out) approach in Programming
- FIFO vs LIFO approach in Programming
- LIFO (Last-In-First-Out) approach in Programming
- Reversing a queue using recursion
- Sorting a Queue without extra space
- Sliding Window Maximum (Maximum of all subarrays of size k)
- Find the largest multiple of 3 | Set 1 (Using Queue)
- Find the first circular tour that visits all petrol pumps
- Smallest multiple of a given number made of digits 0 and 9 only
- Implement PriorityQueue through Comparator in Java
- An Interesting Method to Generate Binary Numbers from 1 to n
- Sum of minimum and maximum elements of all subarrays of size k.
- Distance of nearest cell having 1 in a binary matrix
- Level order traversal line by line | Set 2 (Using Two Queues)
- First negative integer in every window of size k
- Minimum sum of squares of character counts in a given string after removing k characters
- Queue based approach for first non-repeating character in a stream
- Check if all levels of two trees are anagrams or not
- Check if X can give change to every person in the Queue