Min Stack, is a LeetCode problem from data-structures subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Min Stack at LeetCode

Solution

only when the new pushed value is less than the top value,

          and remove values correspond to pop operation

Time Complexity: O(1), Space Complexity: O(n)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu