J'ai postulé en ligne. J'ai passé un entretien chez TikTok (State College, PA) en oct. 2021
Entretien
OA, 2 easy questions. One for binary tree diameter, calculate the maximum length of a path in a binary tree, it can be solved using dfs. The other is a scheduling problem, find the maximum number of available rooms without conflicting.
Questions d'entretien [1]
Question 1
What is the time complexity? Can you use stack instead of recursion?
2 rounds coding a lot of background questions very strange behavior from interviewer camera was off and asked questions in mandarin, leetcode medium-hard and very very slow communication from recruiters based in asia for an english role
J'ai passé un entretien chez TikTok (San Francisco, CA)
Entretien
OA - 1 arrays Medium, 1 Trie Hard. I had 45 minutes to complete that. I was able to do the medium in about 15-20 minutes but I am not that great with trie ds so I was not able to finish.
J'ai postulé en ligne. J'ai passé un entretien chez TikTok (Singapour) en juin 2026
Entretien
1 round of tech interview where i was asked basic tech questions and given a leetcode question to solve. total was around 1 hour. interviewer did not seem happy with my answer and time complexity.