# Category Archives: Data Structures

What is Parallel Stack? A parallel stack is a type of data structure that allows multiple threads to access and manipulate the stack concurrently.  In… Read More
What is Hypergraph? A hypergraph is a generalization of a graph, where an edge can connect any number of vertices. In a hypergraph, each edge… Read More
Given a stack, the task is to reverse the stack using the queue data structure. Examples: Input: Stack: (Top to Bottom) [10 -> 20 ->… Read More
Given an array arr[] of size N, the task is to find the maximum sum of a subset of the array such that the sum… Read More
Given an array arr[] of size N consisting only of 0s and 1s, the task is to find the minimum number of operations required to… Read More
The array is the collection of the same type of data- type. To know more about arrays, refer here. What happens when we address an… Read More
Given a positive integer N and an integer K, The task is to find all prime numbers in the range of 1 to N that… Read More
Given an array arr[] of size N, where each value represents the number of elements present of the ith type, the task is to find… Read More
Basic Operations on Queue:  Some of the basic operations for Queue in Data Structure are: enqueue() – Insertion of elements to the queue. dequeue() –… Read More
Given an array, arr[] of size N, Given M queries and each query consisting of a number X, the task is to subtract X from… Read More
Given an array arr[] of size N having positive elements, the task is to find the minimum number of deletion or append operations to make… Read More
Given an array arr[] of positive integers of size N, the task is to find the minimum possible size of the array that can be… Read More
Given an undirected graph with N nodes (numbered from 0 to N-1) such that any node can be reached from any other node and there… Read More
Given an Unbalanced binary search tree (BST) of M nodes. The task is to find the N elements in the Unbalanced Binary Search Tree in… Read More
You have a browser of one tab where you start on the homepage and you can visit another URL, get back in the history number… Read More