Basic Problems Involving Queue Data Structure

In this section we will go through basic programming problems involving arrays.

Process and print jobs in a Queue in order

One of the key characteristics of a queue is the First-In-First-Out (FIFO) principle. This means that the first item added to the queue will be the first one to be processed or removed. This concept is particularly relevant in the context of print queues, where the first job added to the queue should be the first one to be printed. Read More

Implement Stack using Queue Data Structure

Stacks are a fundamental data structure that follow the Last-In-First-Out (LIFO) principle. This principle is exactly opposite of First-In-First-Out (FIFO) principle on Queue data structure is based on. While stacks can be implemented directly using an array or a linked list, they can also be constructed using two queues. Read More