Three rounds in a row.
Each round, they will ask you a medium LeetCode algorithm problem and some networking or databases fundamentals.
The first algorithm is forming a binary tree with pre-order and in-order sequences. The second one is a sliding window problem. The third is a tree traversal problem.
Not that hard.
Here are some topics to cover:
The following metrics were computed from 3 interview experiences for the ByteDance Backend Software Engineer role in China.
ByteDance's interview process for their Backend Software Engineer roles in China is fairly selective, failing a large portion of engineers who go through it.
Candidates reported having very good feelings for ByteDance's Backend Software Engineer interview process in China.