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 hints, but I didn't fully grasp them, which is a pity.
Two coding questions:
The following metrics were computed from 2 interview experiences for the ByteDance Machine Learning Engineer role in San Jose, California.
ByteDance's interview process for their Machine Learning Engineer roles in San Jose, California is fairly selective, failing a large portion of engineers who go through it.
Candidates reported having very good feelings for ByteDance's Machine Learning Engineer interview process in San Jose, California.