## String after processing backspace characters

Given a string S containing letters and ‘#‘. The ‘#” represents a backspace. The task is to print the new string without ‘#‘. Examples: Input… 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 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
- Density of Binary Tree using Level Order Traversal
- LRU Approximation (Second Chance Algorithm)
- Print all the nodes except the leftmost node in every level of the given binary tree
- Iterative approach to check if a Binary Tree is Perfect
- Sort the Queue using Recursion
- Find the sum of leafs at maximum level
- Print the final string when minimum value strings get concatenated in every operation
- Minimum operations required to make every element greater than or equal to K
- Print even positioned nodes of even levels in level order of the given binary tree

Given a string S containing letters and ‘#‘. The ‘#” represents a backspace. The task is to print the new string without ‘#‘. Examples: Input… Read More »

Given a binary tree, print all nodes between two given levels in a binary tree. Print the nodes level wise, i.e., the nodes for any… Read More »

Given a Queue of integers. The task is to check if consecutive elements in the queue are pairwise consecutive. Examples: Input: 1 2 5 6… Read More »

Given a Queue of integers. The task is to check if consecutive elements in the queue are pairwise consecutive. Examples: Input : 1 2 5… Read More »

Write a function to print spiral order traversal of a tree. For below tree, function should print 1, 2, 3, 4, 5, 6, 7. Recommended:… Read More »

FIFO is an abbreviation for first in, first out. It is a method for handling data structures where the first element is processed first and… Read More »

Approved Offer. Bank Of America has visited our college for on campus recruitment . The recruitment consisted of 4 Rounds in total. The recruitment was… Read More »

Priority Queue is an extension of the queue with following properties. 1) An element with high priority is dequeued before an element with low priority.… Read More »

Given a binary tree, find the maximum vertical level sum in binary tree. Examples: Input : 3 / \ 4 6 / \ / \… Read More »

There were a total of 3 rounds. 1st was online coding, 2nd was written coding and last round was divided in three parts, basically 3… Read More »

Given an array of integers and a number K with initial and final values. Your task is to find the minimum number of steps required… Read More »

Given lengths of n rods in an array a[]. If any person picks any rod, half of the longest rod (or (max + 1) /… Read More »

Write a function to print spiral order traversal of a tree. For below tree, function should print 1, 2, 3, 4, 5, 6, 7. You… Read More »

Suppose there are n towns connected by m bidirectional roads. There are s towns among them with a police station. We want to find out… Read More »

Given a queue of integers of even length, rearrange the elements by interleaving the first half of the queue with the second half of the… Read More »