谷歌L3上门

一年经验, CS 小本

第一轮

第二轮

  • Chocolate Sweetness
    Follow-up: can we optimize the split function from O(N)? Yes - cumulative sum and binary search makes it O(k*logN)

第三轮

第四轮: [Googleyness and Leadership]

  • Mostly related to stuff on my CV plus questions like how do you deal with problematic teammates, most difficult/rewarding problem you’ve solved in your career etc.

第五轮

  • https://leetcode.com/problems/palindromic-substrings
    Got to the DP O(N^2) time O(N) space solution quickly. Interviewer said he wanted better space complexity, I could not figure out the 2 pointer approach. Interviewer gave me a hint near the end of the interview, and was able to solve and code the optimal one.

挂在第五轮

1 Like

第三轮感觉面试官不礼貌啊。。这个可以report给hr