## Bank Of America (BA Continuum India Pvt. Ltd.) Campus Recruitment

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 »

- Sliding Window Maximum (Maximum of all subarrays of size k) using stack in O(n) time
- Print the last k nodes of the linked list in reverse order | Recursive approach
- Program to reverse a linked list using Stack
- Difference between Stack and Queue Data Structures
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Print Stack Elements from Bottom to Top
- Iterative Postorder traversal | Set 3
- Find maximum in stack in O(1) without using additional stack
- Sum of bitwise AND of all submatrices
- Sum of maximum elements of all possible sub-arrays of an array
- Sum of minimum elements of all possible sub-arrays of an array
- Sum of Bitwise-OR of all Submatrices
- Check if the two given stacks are same
- Number of submatrices with OR value 1
- Number of submatrices with all 1s
- Delete all even elements from a stack
- Print leaf nodes in binary tree from left to right using one stack
- Reverse the Sentence using Stack
- Design a stack which can give maximum frequency element
- Analyzing BufferOverflow with GDB
- Implementing Forward Iterator in BST
- Nodes from given two BSTs with sum equal to X
- Triplet with a given sum in BST | Set 2

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 »

Given an array, print the Next Smaller Element (NSE) for every element. The Smaller smaller Element for an element x is the first smaller element… Read More »

The stack organization is very effective in evaluating arithmetic expressions. Expressions are usually represented in what is known as Infix notation, in which each operator… Read More »

The computers which use Stack-based CPU Organization are based on a data structure called stack. The stack is a list of data words. It uses… Read More »

Online Round: This round was held on Hackerrank for 1:30 hrs. There were two questions in this round. A tree was given with upto 10^5 nodes.… 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 »

You are given 3 stacks, A(Input Stack), B(Auxiliary Stack) and C(Output Stack). Initially stack A contains numbers from 1 to N, you need to transfer… Read More »

Given q number of queries, you need to perform operations on the stack. Queries are of three types 1, 2 and 3. If the operation… 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 »

Given two bracket sequences S1 and S2 consisting of ‘(‘ and ‘)’. The task is to check if the string obtained by concatenating both the… 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 »

Given a string of characters. The task is to write a program to print the characters of this string in sorted order using stack. Examples:… Read More »

Given an array of distinct elements, find previous greater element for every element. If previous greater element does not exist, print -1. Examples: Input :… Read More »

Consider a pipe of length L. The pipe has N water droplets at N different positions within it. Each water droplet is moving towards the… Read More »

Infix : An expression is called the Infix expression if the operator appears in between the operands in the expression. Simply of the form (operand1… Read More »