## Count of prime factors of N to be added at each step to convert N to M

Given two integers N and M, the task is to find out minimum number of operations required to convert N to M. Each operation involves… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Priority Queue of Vectors in C++ STL with Examples
- Queue of Pairs in C++ STL with Examples
- Find the K closest points to origin using Priority Queue
- Level order traversal in spiral form | Using Deque
- Priority queue of pairs in C++ with ordering by first and second element
- Implementing Water Supply Problem using Breadth First Search
- What is a Webcrawler and where is it used?
- Real-time application of Data Structures
- Boundary Level order traversal of a Binary Tree
- Diamond Tree
- Design a Queue data structure to get minimum or maximum in O(1) time
- 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
- Print all Exponential Levels of a Binary Tree
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Length of Smallest Subsequence such that sum of elements is greater than equal to K
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- Append the elements of queue in mirror-inverse order
- CPU Scheduling in Operating Systems using priority queue with gantt chart
- Maximum absolute difference between any two level sum in a Binary Tree
- Static and Dynamic data structures in Java with Examples
- Clockwise Triangular traversal of a Binary Tree
- Find integral points with minimum distance from given set of integers using BFS
- Nth positive number whose absolute difference of adjacent digits is at most 1
- Print Nth Stepping or Autobiographical number
- Minimum difference between maximum and minimum value of Array with given Operations
- Minimum possible modifications in the matrix to reach destination
- Array value by repeatedly replacing max 2 elements with their absolute difference
- Minimum number of operations required to set all elements of a binary matrix

Given two integers N and M, the task is to find out minimum number of operations required to convert N to M. Each operation involves… Read More »

Given a graph G with V nodes and E edges, the task is to colour no more than floor(V/2) nodes such that every node has… Read More »

Given an array arr[] of N positive integers and two positive integers S and K, the task is to reach the position of the array… Read More »

Given an array arr[] of N positive integers and a number S, the task is to reach the end of the array from index S.… Read More »

Given an array arr[] of N elements, the task is to perform the following operation: Pick the two largest element from the array and remove… Read More »

Given an array arr[] of positive integers of size N and a positive integer K, the task is to find the maximum possible length of… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find the maximum absolute difference of level sum in it. Examples: Input:… Read More »

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time… Read More »

Given a tree with N nodes numbered from 1 to N and an permutation array of numbers from 1 to N. Check if it is… Read More »

Given an array of integers arr[], the task is to find the remaining element in the array after performing the following operations: In each turn,… Read More »

Given a list of n points on 2D plane, the task is to find the K (k < n) closest points to the origin O(0,… Read More »

Given a binary matrix mat[][] consisting of 1s and 0s of dimension M * N, the task is to find the number of operations to… Read More »

Given a numeric string target of length N and a set of numeric strings blocked, each of length N, the task is to find the… Read More »

Priority Queue: Priority queue is the extension of the queue in which elements associated with priority and elements having higher priority is popped first. Priority… Read More »

Given an array arr size N, the task is to print the final array value remaining in the array when the maximum and second maximum… Read More »