Min Stack
Last updated
What is Min Stack?
Design a stack that supports push, pop, top, and retrieving the minimum element, all in O(1) time. The trick is to maintain a second stack that tracks the current minimum at each level. This problem teaches you that stacks can be augmented to carry extra state without breaking their core behavior.
Free resources to learn Min Stack
More in stage 6: Stacks
Min Stack: common questions
Can I learn Min Stack in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Min Stack in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Min Stack tutorial for beginners?
It is lesson 28 of 137 in the free LeetCode roadmap, in stage 6, Stacks. If you are new to LeetCode, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.