Good base; weekly happy hour
Fast pace; night meeting; RSU vesting policy.
Two coding questions were presented. One was categorized as easy, and the other as medium (though I believe it should have been categorized as hard). The topic was finding a node at a k distance in a binary tree. The interviewer provided practical
Interview 1: Self-introduction -- bias-variance trade-off, how to avoid overfitting/underfitting -- coding. Interview 2: Talk about research: how to find the closest vector to a given vector in N given vectors? How to approximate this when N is ve
Intermediate difficulty, catching rainwater. The interviewer is helpful and engaging the whole time. Ask for a resume deep dive and one LeetCode-style question. For the Q&A session, I asked what the role will be like and what tech stack is required.
Two coding questions were presented. One was categorized as easy, and the other as medium (though I believe it should have been categorized as hard). The topic was finding a node at a k distance in a binary tree. The interviewer provided practical
Interview 1: Self-introduction -- bias-variance trade-off, how to avoid overfitting/underfitting -- coding. Interview 2: Talk about research: how to find the closest vector to a given vector in N given vectors? How to approximate this when N is ve
Intermediate difficulty, catching rainwater. The interviewer is helpful and engaging the whole time. Ask for a resume deep dive and one LeetCode-style question. For the Q&A session, I asked what the role will be like and what tech stack is required.