Design a Stack that Supports getMin() in O(1) Time - Algorithm Room

Implement a Stack using an Array Implement a Stack using a Linked List Reverse a String using a Stack Check for Balanced Parentheses Convert Infix Expression to Postfix Expression Evaluate a Postfix Expression Find the Next Greater Element Implement Two Stacks in One Array Design a Stack that Supports getMin() in O(1) Time Sort a Stack using Recursion

Implement Linear Queue using Arrays Simulate a real-life Queue System

Subject: Data Structure and Algorithm

Design a Stack that Supports getMin() in O(1) Time

Implement a special stack that supports push, pop, peek, and an additional operation getMin() to return the minimum element in constant time.

Select file or drag and drop

PNG, JPG, SVG

Select File