Min Stack - LeetCode (Solution & Explanation | JavaScript)

#min #stack #leetcode Min Stack - LeetCode Question: https://leetcode.com/problems/min-stack/ Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top() -- Get the top element. getMin() -- Retrieve the minimum element in the stack. Topic(s): Stack, Design Problem #: 155