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

- Zig Zag Level order traversal of a tree using single queue
- 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
- Array implementation of queue (Simple)
- FIFO (First-In-First-Out) approach in Programming
- Minimum number of given operations required to make two strings equal
- Print all nodes between two given levels in Binary Tree
- K-th Greatest Element in a Max-Heap
- Minimum distance to the end of a grid from source
- Iterative Method To Print Left View of a Binary Tree
- Shortest Path using Meet In The Middle
- Iterative Letter Combinations of a Phone Number
- Difference between Stack and Queue Data Structures
- Bank Of America (BA Continuum India Pvt. Ltd.) Campus Recruitment
- Check if moves in a stack or queue are possible or not
- Check if Queue Elements are pairwise consecutive
- Canonical Huffman Coding
- Check if N is divisible by a number which is composed of the digits from the set {A, B}
- Difference between a Static Queue and a Singly Linked List
- Nth number made up of odd digits only
- Reverse Cuthill Mckee Algorithm
- Check if Queue Elements are pairwise consecutive | Set-2
- String after processing backspace characters

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 »