## Find the count of unvisited indices in an infinite array

Given an array of infinite length and two integers M and N which are co-primes, the task is to find the number of positions that… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Real-time application of Data Structures
- Priority queue of pairs in C++ with ordering by first and second element
- Priority Queue of Vectors in C++ STL with Examples
- Find the K closest points to origin using Priority Queue
- Queue of Pairs in C++ STL with Examples
- Design a Queue data structure to get minimum or maximum in O(1) time
- Important functions of STL Components in C++
- Implementing Water Supply Problem using Breadth First Search
- What is a Webcrawler and where is it used?
- Boundary Level order traversal of a Binary Tree
- Diamond Tree
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Longest subarray whose elements can be made equal by maximum K increments
- Length of Smallest Subsequence such that sum of elements is greater than equal to K
- Static and Dynamic data structures in Java with Examples
- Sum and product of K smallest and largest Fibonacci numbers in the array
- CPU Scheduling in Operating Systems using priority queue with gantt chart
- Print all Exponential Levels of a Binary Tree
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- Minimum difference between maximum and minimum value of Array with given Operations
- Minimum possible modifications in the matrix to reach destination
- Append the elements of queue in mirror-inverse order
- Maximum absolute difference between any two level sum in a Binary Tree
- Clockwise Triangular traversal of a Binary Tree
- Find integral points with minimum distance from given set of integers using BFS
- Array value by repeatedly replacing max 2 elements with their absolute difference
- Minimum Cost using Dijkstra by reducing cost of an Edge
- Different Types of Queues and its Applications
- Nth positive number whose absolute difference of adjacent digits is at most 1

Given an array of infinite length and two integers M and N which are co-primes, the task is to find the number of positions that… Read More »

Given a tree with N vertices numbered from 0 to N – 1 and Q query containing nodes in the tree, the task is to… Read More »

Given a dictionary, and two words start and target (both of the same length). Find length of the smallest chain from start to target if… Read More »

Given a binary array arr[], the task is to design a data structure that supports the following operations in O(1). Type 1: Remove and print… Read More »

Like stack, queue is a linear data structure that stores items in First In First Out (FIFO) manner. With a queue the least recently added… Read More »

Given a range [L, R], the task is to find the count of numbers from this range that satisfy the below conditions: All the digit… Read More »

Given an integer N which represents the number of cards in a deck. The deck is ordered from 1 to N where 1 is the… Read More »

Given a binary tree, the task is to print the odd positioned nodes of even levels in the level order traversal of the tree. The… Read More »

Given a binary tree, the task is to print the even positioned nodes of odd levels in the level order traversal of the tree. The… Read More »

Given a binary tree, the task is to print the odd positioned nodes of odd levels in the level order traversal of the tree. The… Read More »

Given a queue. The task is to reverse the queue using another another empty queue. Examples: Input: queue[] = {1, 2, 3, 4, 5} Output:… Read More »

Given a binary tree, the task is to check whether the binary tree contains a duplicate sub-tree of size two or more. Input: A /… Read More »

Given an integer N, the task is to print first Nth pure numbers. A number is said to be pure if It has even number… Read More »

Given a maze with obstacles, count number of paths to reach rightmost-bottom most cell from the topmost-leftmost cell. A cell in the given maze has… Read More »

Given a two dimensional grid, each cell of which contains integer cost which represents a cost to traverse through that cell. The task is to… Read More »