Tag: Google interview questions

  • 155. Min Stack

    155. Min Stack

    Design a stack that can return the minimum element in constant time and also support pus, pop and top methods. Example:Input[“MinStack”,”push: -3″,”push: 0″,”push: -5″,”getMin”,”pop”,”top”,”getMin”]

  • 20. Valid Parentheses Leetcode Solution

    20. Valid Parentheses Leetcode Solution

    Return boolean indicating wether the pairs of paranthesis are matching and there are no un-matched paranthesis found. Using a list to implement a stack in Python.Store all the pairs of opening and closing tags in a dictionary. Closing brackets are the key.Go.