[Neetcode/Stack] Minimum Stack

https://neetcode.io/problems/minimum-stack?list=neetcode150

NeetCode

class MinStack:
    def __init__(self):
        self.stack = []
        self.min_stack = []

    def push(self, val: int) -> None:
        self.stack.append(val)

        if self.min_stack:
            min_stack_element = self.min_stack[-1]
            self.min_stack.append(min(val, min_stack_element))
        else:
            self.min_stack.append(val)

    def pop(self) -> None:
        if self.stack:
            self.stack.pop()
            self.min_stack.pop()

    def top(self) -> int:
        if self.stack:
            return self.stack[-1]

    def getMin(self) -> int:
        return self.min_stack[-1]