NeetCode #350LC-155MediumStackNC 150NC 250
← Back to All Problems#350 · #155 · Min Stack(最小栈)
📌 Problem Statement & Constraints
Design a stack supporting
push, pop, top and getMin, all in O(1) time. Constraints: -2^31 <= val <= 2^31 - 1; at most 3 * 10^4 calls; pop, top and getMin are only called on a non-empty stack.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!