## Minimum number of given operations required to make two strings equal

Given two strings A and B, both strings contain characters a and b and are of equal lengths. There is one _ (empty space) in… 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 two strings A and B, both strings contain characters a and b and are of equal lengths. There is one _ (empty space) in… Read More »

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 »