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
First, there is a self-introduction, followed by coding problems and questions about the details of your project. Although it is a Machine Learning position, many questions are asked about deep learning. The code problems involve writing down the pro
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
First, there is a self-introduction, followed by coding problems and questions about the details of your project. Although it is a Machine Learning position, many questions are asked about deep learning. The code problems involve writing down the pro