Stack

Check if brackets are properly matched.

Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle, and the last positio

Given a single positive integer x, we will write an expression of the form x (op1) x (op2) x (op3) x ... where each operator op1, op2, etc. is either addition, subtraction, multiplication, or

Stack with O(1) getMin.

Evaluate postfix expression.

Days until warmer temperature.

Count car fleets arriving at destination.

Largest rectangle area in histogram.