ByteDance

One LeetCode question: Use a prefix tree (Trie) to build a library search by title. Maps are not allowed. The Add() and Search() operations should have O(n) time complexity. Please self-introduce.

Three tech interview rounds and one HR interview. The tech interviews covered algorithms (LeetCode medium level), networking, and OS questions. The HR interview included some open-ended behavioral questions. The whole process took 3-4 weeks.

There are many rounds. The interview is more focused on your past project experience and basic Linux/cloud knowledge. Prepare one story to showcase your problem-solving skills. For the first 2-3 rounds, expect 1-2 coding questions. You can prepare u