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.
You are given an array of integers nums. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.
Return the maximum value in each sliding window.
The following metrics were computed from 12 interview experiences for the ByteDance Machine Learning Engineer role in United States.
ByteDance's interview process for their Machine Learning Engineer roles in the United States is very selective, failing most engineers who go through it.
Candidates reported having very good feelings for ByteDance's Machine Learning Engineer interview process in United States.