{"id":1943,"date":"2020-07-01T09:45:53","date_gmt":"2020-07-01T09:45:53","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=1943"},"modified":"2023-05-25T06:20:31","modified_gmt":"2023-05-25T06:20:31","slug":"get-minimum-element-from-stack","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/get-minimum-element-from-stack\/","title":{"rendered":"Get Minimum Element from Stack"},"content":{"rendered":"

\"\"<\/p>\n

Get minimum element from stack is a common problem in computer science. A stack is a data structure that follows the Last-In-First-Out (LIFO) principle, where elements are added and removed from the top of the stack. While accessing and removing elements from the top of the stack is straightforward, finding the minimum element poses a challenge since the stack does not inherently provide direct access to it.<\/p>\n

How to get Minimum Element from Stack<\/h2>\n

Design a Data Structure that performs the Stack operation like push(), pop() and one more operation getMin(), getMin() function should return the minimum element from the stack. The interviewer also told him that all these operations must be in O(1) time and use only stack data structure.<\/p>\n

    \n
  1. push(x) – Push element x onto stack.<\/li>\n
  2. pop() – Removes the element on top of the stack.<\/li>\n
  3. top() – Get the top element.<\/li>\n
  4. getMin() – Get the minimum element in the stack.<\/li>\n<\/ol>\n

    <\/strong><\/u><\/a><\/p>\n

    STACK DATA STRUCTURE<\/h3>\n

    An Abstract Data Type (ADT) that is often used in most programming languages is a stack. It is called a stack because it functions like a stack in the real world, such as a deck of cards, a pile of dishes, etc.<\/p>\n

    A LIFO data structure is a stack. The acronym LIFO means last-in, first out. In this case, the piece that was added or inserted last is the one that gets accessible first. Insertion operations are referred to as PUSH operations and removal operations as POP operations in the context of stacks.<\/p>\n

    The use of an array, structure, pointer, or linked list can be used to implement a stack. A stack may have a feeling of dynamic resizing or it may have a fixed size.<\/p>\n

    PUSH Operation:<\/strong>
    \nAdds an item in the stack. If the stack is full, then it is said to be an Overflow condition.<\/p>\n

    POP Operation:<\/strong>
    \nRemoves an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.<\/p>\n

    GET MINIMUM:<\/strong>
    \nRetrieve the minimum element in the stack.<\/p>\n

    TOP :<\/strong>
    \nGet the top element.<\/p>\n

    \"\"<\/p>\n

    Code Implementation<\/h3>\n\t\t\t\t\t\t