## 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 »

- Iterative Method To Print Left View of a Binary Tree
- Iterative Letter Combinations of a Phone Number
- Check if it is possible to reach a number by making jumps of two given length
- Difference between Stack and Queue Data Structures
- Minimum distance to the end of a grid from source
- Shortest Path using Meet In The Middle
- Minimum distance to the corner of a grid from source
- Sum of nodes in bottom view of Binary Tree
- Minimum steps required to reach the end of a matrix | Set 2
- Rearrange numbers in an array such that no two adjacent numbers are same
- Smallest multiple of N formed using the given set of digits
- Reverse Cuthill Mckee Algorithm
- Iterative approach to check if a Binary Tree is Perfect
- Find the sum of leafs at maximum level
- LRU Approximation (Second Chance Algorithm)
- Print all the nodes except the leftmost node in every level of the given binary tree
- Density of Binary Tree using Level Order Traversal
- Print the final string when minimum value strings get concatenated in every operation
- Print even positioned nodes of even levels in level order of the given binary tree

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

Given a binary grid of order r * c and an initial position. The task is to find the minimum distance from the source to… Read More »

Given an integer array containing digits from [0, 9], the task is to print all possible letter combinations that the numbers could represent. A mapping… Read More »

Given a Binary Tree, print it’s left view. Left view of a Binary Tree is a set of nodes visible when tree is seen from… Read More »

Stack A stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the… Read More »