Track the Maximum Element in a Stack.

Objective: In a Stack, keep track of the maximum value in it. It might be the top element in the stack but once it is popped out, the maximum value should be from the rest of the elements in the stack.

Approach:

• Create another Stack(call it track) which will keep track of the maximum in the given Stack(call it main).
• When you insert an element in the main stack for the first time (which means it is empty), insert it in the track Stack as well.
• Now onwards when you insert a new element(say it is x) in the main Stack, peek() the element from the track Stack ( say it is 'a'). Compare x and a and whichever is greater, insert it into track Stack.
• When you pop the element from the main stack, pop from the track Stack as well
• So to get to know the maximum element in the main Stack, peek at the element in the track Stack. . See the Example below.

Thanks, Gaurav Dey for suggesting this solution.

Run This Code

Code:

Output:

Max Element is 18
Removing Element 18
Max Element is 14

Also Read:

- Given an array, print all unique subsets with a given sum. Medium
- Sort the two dimensional (2D) array - In-place Medium
- Majority Element – Part 1 Beginner
- Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. Medium
- ZigZag OR Diagonal traversal in 2d array/Matrix using queue Medium
- Find two smallest elements in a given array Beginner
- Find no of reverse pairs in an array which is sorted in two parts in O(N) Medium
- Print All Combinations of subset of size K from Given Array Hard