## Preorder from Inorder and Postorder traversals

Given Inorder and Postorder traversals of a binary tree, print Preorder traversal. Example: Input: Postorder traversal post[] = {4, 5, 2, 6, 3, 1} Inorder… Read More »

- Stack of Pair in C++ STL with Examples
- Real-time application of Data Structures
- C/C++ program for calling main() in main()
- Maximize sum of topmost elements of S stacks by popping at most N elements
- Range Sum and Update in Array : Segment Tree using Stack
- Append the elements of queue in mirror-inverse order
- Static and Dynamic data structures in Java with Examples
- Minimum steps required to make an array decreasing
- Generate Complete Binary Tree in such a way that sum of non-leaf nodes is minimum
- Difference between Stack and Array
- Program to convert Infix notation to Expression Tree
- Sort array such that absolute difference of adjacent elements is in increasing order
- Print all K-sum levels in a Binary Tree
- Min difference between maximum and minimum element in all Y size subarrays
- Parsing String of symbols to Expression
- Maximum of XOR of first and second maximum of all subarrays
- Output of Java Programs | Set 55 (Java Collections Framework)
- Reverse the elements only at odd positions in the given Array
- Find number of subarrays ending with arr[i] where arr[i] is the minimum element of that subarray
- Find the number of unique pairs satisfying given conditions
- Minimum operation required to make a balanced sequence
- Minimum integer that can be obtained by swapping adjacent digits of different parity
- Stack machine in Computer Organisation
- Sum of decomposition values of all suffixes of an Array
- Maximize removal of adjacent array elements based on their absolute value
- Check if a string can be split into even length palindromic substrings
- Level order traversal in spiral form using stack and multimap
- Calculate weight of parenthesis based on the given conditions
- Find the missing end tag in the given HTML Code
- Check given string is oddly palindrome or not | Set 2

Given Inorder and Postorder traversals of a binary tree, print Preorder traversal. Example: Input: Postorder traversal post[] = {4, 5, 2, 6, 3, 1} Inorder… 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 »

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 »