Prepbytes Blog

Stacks

Arithmetic Expression Evaluation

Abhinav JainAugust 25, 2022April 27, 2023

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...

Stacks

Next Greater Element

Abhinav JainAugust 25, 2022September 13, 2022

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...

Stacks

Check for Balanced Parentheses in an Expression

Abhinav JainAugust 25, 2022May 11, 2023

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...

Stacks

How to Solve Stock Span Problem?

Abhinav JainAugust 25, 2022October 13, 2022

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...

Heap

Max Heap in Java

Aman KumarAugust 25, 2022December 14, 2022

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 ....

Stacks

Implement a Stack Using Single Queue

Ankit KocharAugust 25, 2022December 14, 2022

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...

Arrays

Array implementation of queue simple

Abhishek SharmaAugust 16, 2022December 14, 2022

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...

Python

Queue.LifoQueue vs Collections.Deque

Abhishek SharmaJuly 20, 2022August 30, 2022

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....

Python

Difference Between queue.queue Vs collections.deque In Python

Ankit KocharJuly 20, 2022August 30, 2022

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....

Queues

Implement Stack Queue using Deque

Ankit KocharJuly 20, 2022December 14, 2022

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...

Trees

Level Order Traversal Line Set 3 Using One Queue

Abhishek SharmaJuly 20, 2022December 14, 2022

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...

Queues

What Are The Drawbacks Of Simple Queues In Data Structures

Abhishek SharmaJuly 19, 2022April 26, 2023

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...

Trees

Right View Binary Tree Using Queue

Abhishek SharmaJuly 19, 2022December 14, 2022

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:...

Queues

What is a device queue?

Abhishek SharmaJuly 19, 2022August 30, 2022

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)...

Arrays

Kth Smallest Element In An Unsorted Array Using Priority Queue

Abhishek SharmaJuly 19, 2022December 14, 2022

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...

Queues

Priority Queue using Binary Heap

Ankit KocharJuly 19, 2022December 14, 2022

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”...

Linked list articles

Circular Queue | Set 2 (Circular Linked List Implementation)

Ankit KocharJuly 19, 2022December 14, 2022

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...

Operating system

Process scheduler PCBs and queueing

Abhishek SharmaJuly 14, 2022August 30, 2022

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...

Linked list articles

Convert a given Binary Tree To Circular Doubly Linked List

PrepBytesJuly 13, 2022December 14, 2022

![](https://prepbytes-misc-images.s3.ap-south-1.amazonaws.com/assets/1645007594981-Article_164.png) In this article, we will deep dive and discuss how to convert the binary tree to circular doubly linked list. Converting a binary tree to circular doubly linked list...

Queues

Difference between Circular Queue and Priority Queue

Ankit KocharJuly 13, 2022August 23, 2022

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...

Queues

Sort the Queue using Recursion

Ankit KocharJuly 12, 2022December 14, 2022

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...

Queues

Reversing a Queue

Ankit KocharJuly 12, 2022May 11, 2023

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...

Queues

Reversing First K Elements Queue

Ankit KocharJuly 12, 2022May 11, 2023

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...

Queues

Reversing Queue using Recursion

Ankit KocharJuly 12, 2022December 14, 2022

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...

Linked list articles

Priority Queue using Doubly Linked List

Ankit KocharJuly 12, 2022December 14, 2022

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...

Queues

Implementation Queue using Javascript

Ankit KocharJuly 12, 2022December 14, 2022

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...

Queues

Sorting Queue Without Extra Space

Abhishek SharmaJuly 12, 2022November 27, 2023

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...

Operating system

Difference Between MLQ And MLFQ CPU Scheduling Algorithms

Abhishek SharmaJuly 12, 2022May 26, 2023

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...

Queues

Multilevel Feedback Queue Scheduling MLFQ CPU Scheduling

Abhishek SharmaJuly 12, 2022August 30, 2022

What is Multilevel Queue Scheduling? In multilevel queue scheduling, all the processes are assigned permanently to the queue at the time of entry. Processes will not move between queues and...

Queues

Implement Priority Queue Comparator Java

Abhishek SharmaJuly 12, 2022June 28, 2024

Priority queues are specialized data structures that manage a set of elements each with an associated priority. Unlike regular queues, where elements are dequeued in the order they were enqueued...

Arithmetic Expression Evaluation

Next Greater Element

Check for Balanced Parentheses in an Expression

How to Solve Stock Span Problem?

Max Heap in Java

Implement a Stack Using Single Queue

Array implementation of queue simple

Queue.LifoQueue vs Collections.Deque

Difference Between queue.queue Vs collections.deque In Python

Implement Stack Queue using Deque

Level Order Traversal Line Set 3 Using One Queue

What Are The Drawbacks Of Simple Queues In Data Structures

Right View Binary Tree Using Queue

What is a device queue?

Kth Smallest Element In An Unsorted Array Using Priority Queue

Priority Queue using Binary Heap

Circular Queue | Set 2 (Circular Linked List Implementation)

Process scheduler PCBs and queueing

Convert a given Binary Tree To Circular Doubly Linked List

Difference between Circular Queue and Priority Queue

Sort the Queue using Recursion

Reversing a Queue

Reversing First K Elements Queue

Reversing Queue using Recursion

Priority Queue using Doubly Linked List

Implementation Queue using Javascript

Sorting Queue Without Extra Space

Difference Between MLQ And MLFQ CPU Scheduling Algorithms

Multilevel Feedback Queue Scheduling MLFQ CPU Scheduling

Implement Priority Queue Comparator Java

Integrated Services Digital Network (ISDN)

VLAN ACL (VACL) in Computer Networks

Inter-VLAN Routing Using a Layer 3 Switch

Access and Trunk Ports in Computer Networks

Role-Based Access Control (RBAC) in Computer Networks

Display Processor in Computer Graphics

Sign in to your account

Login via OTP

Login via OTP

Register with PrepBytes