Higher salary than Meta and Google at the same level.
Low work-life balance in many teams.
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
No behavior questions at all. I was asked LC 239, Sliding Window Maximum, but wasn't able to give an optimized solution. I was interviewed on Friday and got refused the next Monday.
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
No behavior questions at all. I was asked LC 239, Sliding Window Maximum, but wasn't able to give an optimized solution. I was interviewed on Friday and got refused the next Monday.