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

- Array implementation of queue (Simple)
- Iterative Method To Print Left View of a Binary Tree
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Check if it is possible to reach a number by making jumps of two given length
- Iterative Letter Combinations of a Phone Number
- K-th Greatest Element in a Max-Heap
- Minimum number of given operations required to make two strings equal
- Print all nodes between two given levels in Binary Tree
- Minimum distance to the end of a grid from source
- Shortest Path using Meet In The Middle
- Difference between Stack and Queue Data Structures
- Minimum distance to the corner of a grid from source
- Canonical Huffman Coding
- Difference between a Static Queue and a Singly Linked List
- 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}
- String after processing backspace characters
- Reverse Cuthill Mckee Algorithm
- Iterative approach to check if a Binary Tree is Perfect
- 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 »

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 »

Given an N X M matrix, where ai, j = 1 denotes the cell is not empty, ai, j = 0 denotes the cell is… Read More »

Given a binary array, where 1 denotes push operation and 0 denotes a pop operation in a stack or queue. The task is to check… Read More »

Given an integer N, the task is to find the Nth number made up of odd digits (1, 3, 5, 7, 9) only. First few… Read More »

Given three integers N, A and B, the task is to find whether N is divisible by any number that contains only A and B… Read More »