Heap overflow and Stack overflow
The computer’s RAM has a few sections in it. Two of them are heap and stack. Both heap and stack store variables. Let's see about Heap and Stack briefly:- Both...
Next Greater Frequency Element
Problem statement Given an array, consisting of n elements, find the next greater frequency element of each element. The next greater frequency element of any element is the first element...
Evaluation of Postfix Expression
Evaluating postfix expressions, also known as Reverse Polish Notation (RPN), is a fundamental concept in computer science and mathematics. Unlike the more familiar infix notation, where operators are placed between...
Arithmetic Expression Evaluation
Arithmetic expression evaluation is the process of computing the value of a mathematical expression containing arithmetic operators, such as addition, subtraction, multiplication, and division, along with parentheses and operands. Before...
Next Greater Element
Problem statement Given an array, consisting of n elements, find the next greater element of each element. The next greater element of any element is the first larger element to...
Check for Balanced Parentheses in an Expression
In computer science, balanced parentheses are a common requirement for many programming languages and applications. Balanced parentheses refer to an expression in which all opening and closing parentheses are properly...
How to Solve Stock Span Problem?
What is Stock Span Problem: Stock span problem is a commercial problem where we have a series of N prices on the daily basis. And you need to calculate the...
Max Heap in Java
What is Heap? Heap is a special kind of complete binary tree in which the all node has a value greater (or smaller ) than all of its children ....
Implement a Stack Using Single Queue
Problem statement: We have to build a stack with a single queue. What is a Stack? Stack is a linear data structure in which a user can insert and delete...
Array implementation of queue simple
Queue A queue is basically a linear data structure that works on the principle of FIFO (First in First out) which means an element that is enqueued first will be...
Queue.LifoQueue vs Collections.Deque
Both LIFOQueue and Deque are present in the built-in modules Queue and Collections in Python, both of them are widely used data structures, but they are used for different purposes....
Difference Between queue.queue Vs collections.deque In Python
Both Queue and Deque are present in the built-in modules Queue and Collections in Python, both of them are widely used data structures, but they are used for different purposes....
Implement Stack Queue using Deque
What is Deque? Deque is a double ended queue, i.e. a special kind of queue in which insertion and deletion can be done at the both rear as well as...
Level Order Traversal Line Set 3 Using One Queue
Problem Statement: Given a binary tree, print the nodes level by level or level wise and each level on a new line. Queue A queue is basically a linear data...
What Are The Drawbacks Of Simple Queues In Data Structures
Queues are a fundamental data structure used in computer science to manage and store data. They are used in various applications, from operating systems to networking systems, and are widely...
Right View Binary Tree Using Queue
Problem Statement: The problem is straightforward: we have given a binary tree and we have to print the right view of the binary tree. Let's discuss it with an example:...
What is a device queue?
What is the queue? A queue is basically a linear data structure that works on the principle of FIFO (First in First out) which means an element that is enqueued(Insert)...
Kth Smallest Element In An Unsorted Array Using Priority Queue
Problem Statement: The problem statement is straightforward as we have an array of size n and we have to find the kth smallest element in an unsorted array using priority...
Priority Queue using Binary Heap
What is the priority queue? Priority queues are abstract data structures where each element in the queue has a priority value. For example, in any airline, baggage under the “First-Class”...
Circular Queue | Set 2 (Circular Linked List Implementation)
Circular Queue It is a linear data structure that works on the principle of FIFO (First in First out). In this type of queue element can be added in any...
Process scheduler PCBs and queueing
Process Scheduling: It is the activity of the process manager that handles the removal of the running process from the CPU and the selection of another process on the basis...
Difference between Circular Queue and Priority Queue
Circular Queue It is a linear data structure that works on the principle of FIFO (First in First out). In this type of queue element can be added in any...
Sort the Queue using Recursion
Problem Statement: Given a queue, we have to sort the queue using a recursive function without using any loop. We can only use the standard functions for it:- enqueue(element): Add...
Reversing a Queue
In this article, we'll look at how to reverse a queue. We must reverse a queue with only standard operations: enqueue(element): Add an element to the queue's tail. dequeue(): Removes...
Reversing First K Elements Queue
Reverse the first k elements in the queue is a common problem in data structures and algorithms. A queue is a data structure that follows the FIFO (First In First...
Reversing Queue using Recursion
Problem Statement: Given a queue, we have to make a recursive function to reverse it. Queue: A Queue is a linear data structure. Queue follows the FIFO rule i.e. First...
Priority Queue using Doubly Linked List
Problem Statement: Given nodes with their priority, we have to implement a priority queue using a doubly linked list. What is a Priority Queue? Priority queues are abstract data structures...
Implementation Queue using Javascript
What is a Queue? Queue follows the principle of FIFO (First in First out) i.e. element which is inserted first will be removed first. The operation for insertion of elements...
Sorting Queue Without Extra Space
Sorting a queue without utilizing extra space presents an intriguing challenge in computer science. Queues, a fundamental data structure, follow the FIFO (First-In-First-Out) principle, making their sorting a complex task...
Difference Between MLQ And MLFQ CPU Scheduling Algorithms
MLQ scheduling is designed to handle situations where processes have different levels of priority or belong to different categories. It divides the ready queue, which contains all the processes waiting...