Tag: Google interview

  • 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.

  • 66. Plus One LeetCode Solution in Python

    66. Plus One LeetCode Solution in Python

    Given a non empty array of decimal digits representing a non-begative integer.Increment the integer, most significant digit is on the left. Each element contains a single digit.No leading zeros except for the number 0.

  • Google Interview 686. Repeated String Match

    Google Interview 686. Repeated String Match

    Given two strings a and b, return the minimum number of times you should repeat string a so that string b becomes a subscring of sring a.If b cannot be a substring of a after repeating it, return -1.

  • Google 844. Backspace String Compare

    Google 844. Backspace String Compare

    Given two strings s and t, return True if they are equal. ‘#’ means backspace. Solution 1: use a list to implement a stack. append adds an item and pop removes it.