Google Archives - TO THE INNOVATION

Min Stack LeetCode Solution

Leetcode Solution / Amazon, Bloomberg, C++ Solution, Design, Google, Java Solution, JavaScript Solution, LeetCode Solution, Medium, Python Solution, Snapchat, Stack, Uber, Zenefits

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

Pow(x n) LeetCode Solution

Leetcode Solution / Bloomberg, C++ Solution, Facebook, Google, Java Solution, JavaScript Solution, LeetCode Solution, Linkedin, Math, Medium, Python Solution, recursion

Implement pow(x, n), which calculates x raised to the power n.

Wildcard Matching LeetCode Solution

Leetcode Solution / Backtracking, C++ Solution, dynamic programming, Facebook, Google, Greedy, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Python Solution, recursion, Snapchat, String, Twitter, Twosigma

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for ‘?’ and ‘*’ where: ‘?’ Matches any single character.’*’ Matches any sequence of characters (including the empty sequence).The matching should cover the entire input string.

Trapping Rain Water LeetCode Solution

Leetcode Solution / Amazon, Apple, Array, Bloomberg, C++ Solution, dynamic programming, Google, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Python Solution, Stack, Twitter, Two Pointers, Zenefits

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Next Permutation LeetCode Solution

Leetcode Solution / Array, C++ Solution, Google, Java Solution, JavaScript Solution, LeetCode Solution, Medium, Python Solution, Two Pointers

Given an array of integers nums, find the next permutation of nums.

Regular Expression Matching LeetCode Solution

Leetcode Solution / Airbnb, Backtracking, C++ Solution, dynamic programming, Facebook, Google, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Python Solution, String, Twitter, Uber

Given an input string s and a pattern p, implement regular expression matching with support for ‘.’ and ‘*’ where ‘.’ Matches any single character and ‘*’ Matches zero or more of the preceding element.

Valid Parentheses LeetCode Solution

Leetcode Solution / Airbnb, Amazon, Bloomberg, C++ Solution, Easy, Facebook, Google, Java Solution, JavaScript Solution, LeetCode Solution, Microsoft, Python Solution, Stack, String, Twitter, Zenefits

Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.

Merge k Sorted Lists LeetCode Solution

Leetcode Solution / Adobe, Airbnb, C++ Solution, divide and conquer, Facebook, Google, Hard, Heap, Java Solution, JavaScript Solution, LeetCode Solution, Linked List, Linkedin, Microsoft, Python Solution, Twitter, Uber

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it.

Word Search II LeetCode Solution

Leetcode Solution / Airbnb, Backtracking, C++ Solution, Google, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Microsoft, Python Solution, Tree

Given an m x n board of characters and a list of strings words, return all words on the board.

Median of Two Sorted Arrays LeetCode Solution

Leetcode Solution / Adobe, Apple, Array, Binary Search, C++ Solution, divide and conquer, Dropbox, Google, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Microsoft, Python Solution, Yahoo, Zenefits

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).