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

- Iterative Method To Print Left View of a Binary Tree
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Iterative Letter Combinations of a Phone Number
- Check if it is possible to reach a number by making jumps of two given length
- K-th Greatest Element in a Max-Heap
- Minimum distance to the end of a grid from source
- Difference between Stack and Queue Data Structures
- 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
- Check if moves in a stack or queue are possible or not
- Nth number made up of odd digits only
- Check if N is divisible by a number which is composed of the digits from the set {A, B}
- 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 the final string when minimum value strings get concatenated in every operation
- Minimum steps required to reach the end of a matrix | Set 2
- Print even positioned nodes of even levels in level order of the given binary tree

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 »

Given a starting position ‘k’ and two jump sizes ‘d1’ and ‘d2’, our task is to find the minimum number of jumps needed to reach… Read More »

The Cuthill-Mckee algorithm is used for reordering of a symmetric square matrix. It is based on Breadth First Search algorithm of a graph, whose adjacency… Read More »

Given a permutation P = p1, p2, …., pn of first n natural numbers (1 ≤ n ≤ 10). One can swap any two consecutive… Read More »