Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en ByteDance en jun 2021
Entrevista
Initial conversation started on LinkedIn, after showing interest, I was scheduled for a technical interview with someone from the department of the role. Second round was also a technical interview with someone from the location of the role but in a different department. First interview was great, very great interaction with the interviewer, second round, the interviewer seemed distracted and overall stern and straightforward, not very engaging. Both technical interviews covered topics around web technologies, database indexing, HTTP, TCP/IP, performance optimization etc.
Preguntas de entrevista [2]
Pregunta 1
Describe into a bit detail some parts of the OSI model, how HTTPS works and how DNS Works as well
Both rounds of the interview had technical challenges around a Medium on HackerRank. First problem was about creating a DataStructure capable of handling insertions and deletions all in O(1) as well as having a function that returns a random element.
Describe the most complex backend project you have taken charge of in the past. What is the business peak QPS? What technical bottlenecks did you encounter and how did you optimize them?
The interview process was fairly standard. They asked about technical skills, projects, and tested coding abilities. Overall, the communication went smoothly.
The interviewer was guiding throughout the process, helped debug the coding questions, and offered ideas to move forward.
Preguntas de entrevista [1]
Pregunta 1
What’s the most complex or memorable online incident or piece of feedback you’ve experienced?
Acudí a una entrevista en ByteDance (San Jose, CA)
Entrevista
I completed an online OA with 5 MCQs and 2 coding questions: one on implementing a priority queue and the other on finding an answer using binary search. Easy problems on linear data structure
Preguntas de entrevista [1]
Pregunta 1
I cant remember the question specifically, but both involve greedy algorithm with priority q and binary search.