Data Structures & Algorithms In Go/

...

/

Solution Review: Min Stack

Solution Review: Min Stack

Let's discuss the solution of the challenge posed in the previous lesson.

We'll cover the following...

Solution: A two-stack class

We’ll make a new class consisting of two stacks: mainStack and minimumStack. The class will have the following functions:

  • Push()
  • Pop()
  • Min()

Let’s see what each function will do:

  • Push: Push an element to the top of mainStack. It compares the new value with the value at the top of minimumStack. If the new value is smaller, then we push the new value into minimumStack. Otherwise, we ...