店面
Question 1) https://leetcode.com/problems/valid-parentheses/
Question 2) https://leetcode.com/problems/clone-graph/
Onsite 在 Palo Alto
第一轮: Problem Solving (1 hour)
Question 1) https://leetcode.com/problems/maximum-width-of-binary-tree/
Question 2) https://www.geeksforgeeks.org/maximum-sum-path-across-two-arrays/
第二轮: System Design (1 hour)
Designing Instagram https://www.educative.io/courses/grokking-the-system-design-interview/m2yDVZnQ8lG
第三轮 Lunch with hiring manager with some behavioral questions. (1 hour)
第四轮 Problem Solving (1 hour)
Question 1) https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
Question 2) https://leetcode.com/problems/group-anagrams/
第五轮 Problem Solving (1 hour)
Question 1) https://leetcode.com/problems/lru-cache/ (implement it using LinkedList)
Question 2) In a N-ary tree, each node consists of a 2 values X and Y and a list of child nodes. Write a method “boolean find (Node root, int X, int Y)” such that X and Y exists in a tree on the same level but not in the same node.
Question 3) https://leetcode.com/problems/copy-list-with-random-pointer/ (implement it in O(N) with no extra space)