## Introduction to Data Structures | 10 most commonly used Data Structures

A data structure is a particular way of organizing data in a computer so that it can be used effectively. The idea is to reduce… Read More »

## Reverse tree path using Queue

Given a tree and a node, the task is to reverse the path till the given Node and print the in-order traversal of the modified… Read More »

## Sort the Queue using Recursion

Given a queue and the task is to sort it using recursion without using any loop. We can only use the following functions of queue:… Read More »

## Minimum operations required to make every element greater than or equal to K

Given an array of length N. The task is to convert it into a sequence in which all elements are greater than or equal to… Read More »

## Rearrange numbers in an array such that no two adjacent numbers are same

Given an array of integers. The task is to rearrange elements of the array such that no two adjacent elements in the array are same.… Read More »

## Density of Binary Tree using Level Order Traversal

Given a Binary Tree, find the density of it by doing one traversal of it. The density of binary tree is defined as: Density of… Read More »

## Print all the nodes except the leftmost node in every level of the given binary tree

Given a binary tree, the task is to print all the nodes except the leftmost in every level of the tree. The root is considered… Read More »

## Minimum steps required to reach the end of a matrix | Set 2

Given a 2d-matrix mat[][] consisting of positive integers, the task is to find the minimum number of steps required to reach the end of the… Read More »

## Smallest multiple of N formed using the given set of digits

Given a set of digits S and an integer N, the task is to find the smallest positive integer if exists which contains only the… Read More »

## LRU Approximation (Second Chance Algorithm)

If you are not familiar with Least Recently Used Algorithm, check Least Recently Used Algorithm(Page Replacement) This algorithm is a combination of using a queue,… Read More »

## Print even positioned nodes of even levels in level order of the given binary tree

Given a binary tree, print even positioned nodes of even level in level order traversal. The root is considered at level 0, and the left… Read More »

## Print the final string when minimum value strings get concatenated in every operation

Given an array of strings and an array of integers where ith integer of the array corresponds to the value of the ith string present… Read More »

## Find the sum of leafs at maximum level

Given a binary tree containing n nodes. The task is to find the sum of all the leaf nodes present at maximum level. Examples: Input:… Read More »

## Iterative approach to check if a Binary Tree is Perfect

Given a Binary Tree, the task is to check whether the given Binary Tree is a perfect Binary Tree or not. A Binary tree is… Read More »

## Sum of nodes in bottom view of Binary Tree

Given a binary tree, the task is to print the sum of nodes in bottom view of the given Binary Tree. Bottom view of a… Read More »