Nutanix Interview Experience (On-Campus)
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 »
Category Archives: Stack
Microsoft Interview experience | Set 178 (On-Campus Internship for IDC)
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 »
Sudo Placement[1.3] | Playing with Stacks
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 »
Sudo Placement[1.3] | Stack Design
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 »
Maximum length of rod for Q-th person
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 »
Check if concatenation of two strings is balanced or not
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 »
Level order traversal in spiral form | Using one stack and one queue
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 »
Sort string of characters using Stack
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 »
Previous greater element
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 »
Water drop problem
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 to Prefix conversion using two stacks
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 »
Check for balanced parenthesis without using stack
Given an expression string exp, write a program to examine whether the pairs and the orders of “{“, ”}”, ”(“, ”)”, ”[“, ”]” are correct… Read More »
Design a stack to retrieve original elements and return the minimum element in O(1) time and O(1) space
Our task is to design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin()… Read More »
Merging and Sorting Two Unsorted Stacks
Given 2 input stacks with elements in an unsorted manner. Problem is to merge them into a new final stack, such that the elements become… Read More »
Range Queries for Longest Correct Bracket Subsequence Set | 2
Given a bracket sequence or in other words a string S of length n, consisting of characters ‘(‘ and ‘)’. Find length of the maximum… Read More »