Tag: Google interview
-
155. Min Stack
155. Min Stack Solution programming interview question. 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”] OutputMinStack minStack = new MinStack();minStack.push(-3); // returns nullminStack.push(0); // returns nullminStack.push(-5); // returns nullminStack.getMin(); // return -5minStack.pop(); // returns nullminStack.top(); // return 0minStack.getMin(); //…
-
20. Valid Parentheses Leetcode Solution
Valid Parentheses Leetcode 20 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 thru the characters of the string and add…
-
66. Plus One LeetCode Solution in Python
Plus One LeetCode Solution in Python 3. 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. Examples Input: digits = [1,2,3] Output: [1,2,4] Input array represents the int 123 +…
-
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. String “acb” repeated 0 times is “”, repeated 1 times…
-
Google 844. Backspace String Compare
Google Interview 844. Backspace String Compare Given two strings s and t, return True if they are equal. ‘#’ means backspace. Examples Input: s = “ab#c”, t = “ad#c” Output: true Explanation: Both s and t become “ac”. Input: s = “abb#c”, t = “ade#c” Output: false Explanation: s becomes “abc” and t becomes “adc”.…
