I applied online. I interviewed at ByteDance in Mar 2020
Interview
3 rounds in a row. Each round they will ask you a medium LC algorithm problem and some networking or databases fundamentals. First algorithm is form a binary tree with pre-order and in-order sequences. Second one is a sliding window. And third one is a tree traversal problem. Not that hard.
Interview questions [1]
Question 1
1. Algorithms.
2. Databases. Especially transactions.
3. Networking. Especially HTTPS.
I applied online. I interviewed at ByteDance (San Jose, CA) in Aug 2020
Interview
I applied online and was invited to a online video interview. It started off well but after the interviewer explained the problem. My immediate response is to ask the edge cases. Which he shot me down and said 'assume everything is working as expected'. I mean, if we are assuming everything is working as expected then why write code for the problem anyway. Still, I moved forward to explain the approach, which he was not ready to listen and asked me to code. When i started coding, he stopped me frequently to ask questions which is good as he was having a good conversation. But sometimes he would stop me and say dont code it 'this' way code it in another way. Overall, the question was good, find the maxPath in a tree. I did complete the code and it was working (he ran it in the coderpad with some test cases), yet, I got a reject in few days.
I applied through a recruiter. The process took 2 weeks. I interviewed at ByteDance (Singapur) in Aug 2020
Interview
After CV screening, you got two round interviews and both are in a similar format: each of 45-60 mins. Be prepared for your CV and general computer vision knowledge. Interviewers are kind but will ask about all details of your previous projects.
Interview questions [1]
Question 1
Each interview consists of questions about your resume (past research projects/experience), general computer vision/machine learning questions (e.g. explain architectures of modern object detectors), then followed by 1-2 coding problems (LeetCode easy).