Skip to content

Category Archives: Stack

Given postorder traversal of a binary search tree, construct the BST. For example, 1. If the given traversal is {1, 7, 5, 50, 40, 10},… Read More
Given a linked list and a number N. Find the product of last n nodes of the linked list.Constraints : 0 <= N <= number… Read More
Prerequisite: Stack, Hashing Given a stack of N numbers and an array of numbers. Count the numbers of pop operations required to get each element… Read More
Given a stack of integers. The task is to design a special stack such that maximum element can be found in O(1) time and O(1)… Read More
Given a stack of integers, write a function pairWiseSorted() that checks whether numbers in the stack are pairwise sorted or not. The pairs must be… 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 an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element x is the first greater element… Read More
Prerequisites – Recursion, Backtracking and Stack Data Structure. A Maze is given as N*M binary matrix of blocks and there is a rat initially at… Read More
Prerequisites – FIFO (First-In-First-Out) approach in Programming, FIFO vs LIFO approach in Programming LIFO is an abbreviation for last in, first out. It is a… Read More
Given Inorder and Postorder traversals of a binary tree, print Preorder traversal. Example: Input: Postorder traversal post[] = {4, 5, 2, 6, 3, 1} Inorder traversal… 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
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