## Iterative Letter Combinations of a Phone Number

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 »

- Introduction to Data Structures | 10 most commonly used Data Structures
- Rearrange numbers in an array such that no two adjacent numbers are same
- Burn the binary tree starting from the target node
- Minimum steps required to reach the end of a matrix | Set 2
- Count number of ways to reach destination in a Maze using BFS
- Sort the Queue using Recursion
- Reverse tree path using Queue
- Minimum operations required to make every element greater than or equal to K
- Find the maximum cost path from the bottom-left corner to the top-right corner
- Reversing a Queue using another Queue
- Density of Binary Tree using Level Order Traversal
- Smallest multiple of N formed using the given set of digits
- LRU Approximation (Second Chance Algorithm)
- Find the first N pure numbers
- Print all the nodes except the leftmost node in every level of the given binary tree
- 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
- Count of numbers in the range [L, R] which satisfy the given conditions
- Duplicate subtree in Binary Tree | SET 2
- Python | Queue using Doubly Linked List
- Print odd positioned nodes of even levels in level order of the given binary tree
- Find the number on the card that remains in the end after performing the given operations
- Print odd positioned nodes of odd levels in level order of the given binary tree
- Print even positioned nodes of odd levels in level order of the given binary tree
- Queries to find the left-most given type integer in a binary array
- Queue in Python

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

Given a max-heap of size n, find the kth greatest element in the max-heap. Examples: Input : maxHeap = {20, 15, 18, 8, 10, 5,… Read More »

Huffman Coding is a lossless data compression algorithm where each character in the data is assigned a variable length prefix code. The least frequent character… Read More »

Static Queue: A queue is an ordered list of elements. It always works in first in first out(FIFO) fashion. All the elements get inserted at… Read More »

In queue, insertion and deletion happen at the opposite ends, so implementation is not as simple as stack. To implement a queue using array, create… Read More »