Backend Engineer applicants have rated the interview process at ByteDance with 3.3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 43% positive. To compare, the company-average is 49% positive. This is according to Glassdoor user ratings.
Candidates applying for Backend Engineer roles take an average of 11 days to get hired, when considering 7 user submitted interviews for this role. To compare, the hiring process at ByteDance overall takes an average of 26 days.
Common stages of the interview process at ByteDance as a Backend Engineer according to 7 Glassdoor interviews include:
Skills test: 29%
One on one interview: 29%
Presentation: 14%
Phone interview: 14%
Personality test: 14%
Here are the most commonly searched roles for interview reports -
Go through the resume about backend engineer stuff (strongly related to what your resume wrote about) and one LC-like problem I think the difficulty is about easy-medium, some edge cases need to handle
Interview questions [1]
Question 1
Go through the resume about backend engineer stuff (strongly related to what your resume wrote about) and one LC-like problem I think the difficulty is about easy-medium, some edge cases need to handle
OA then a technical interview asked question involving binary search tree. Medium difficulty. Then asked about some system design questions based on projects in my resume about scaling and deployment.
Interview questions [1]
Question 1
Binary search tree questions sorting for matching number to words.
First interview was the with the HR and then after that round, the next one was an interview with the technical person, and This is followed by two other technical rounds.
There are a total of three rounds of interviews, all of which are technical interviews. The focus is mainly on asking about past project experiences. They will inquire about your thoughts and details. In the last part of the first two rounds, there will be handwritten coding tasks, which are all very simple questions.
Interview questions [1]
Question 1
Implement a function to sort tasks that are interdependent.