店面 (45 分钟):
- Binary Search
Onsite (5 轮): 4 rounds of algorithm+coding, 1 round Googleyness and Leadership and 1 lunch interview ( no notes taken )
Googleyness and Leadership questions included:
Examples of leadership
When did you go above and beyond your responsibilities to deliver something
Challenges working with someone remotely
Instance where you did not take no for an answer
Example of failure and how you bounced back
Algorithm+coding questions as below:
- https://leetcode.com/discuss/interview-question/302164/Google-or-Phone-screen-or-Monarchy
- https://leetcode.com/problems/split-array-largest-sum/
- https://www.geeksforgeeks.org/minimum-number-of-squares-whose-sum-equals-to-given-number-n/
Could not find the 4th question on lc/g4g/ctci or any other sources. Maybe same/similar question exists somewhere:
There is an init state, end state and safe states. If you can get from init state to safe state, return ‘disarm’. If not, return ‘run’. Examples as below:
- init: 000
end: 111
safe: 001 010 100 011 111 101
return: disarm - init: 00
end: 11
return: 00 11
return: run