Stack

Given an array of integers, find the nearest greater element to the right for each element. If no such element exists, consider it -1.

Given an array of integers, find the nearest greater element to the left for each element. If no such element exists, consider it -1.

Given an array of integers, find the nearest smaller element to the left for each element. If no such element exists, consider it -1.

Given an array of integers, find the nearest smaller element to the right for each element. If no such element exists, consider it -1.

The stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate the span of the stock's price for each day. The span of the stock's price on a given day is defined as the maximum number of consecutive days (including the given day and going backwards) for which the price of the stock on those days is less than or equal to its price on the given day.

Find the largest rectangular area possible in a given histogram where the largest rectangle can be made of a number of contiguous bars. Assume that all bars have the same width of 1 unit.

Given a binary matrix filled with 0s and 1s, find the largest rectangle containing only 1s and return its area.

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time and using constant extra space.

Given a stack, delete the middle element of it without using any additional data structure.

Given a stack, reverse it using recursion. You are not allowed to use any extra space other than the internal stack space used by recursion.