ByteDance Tech Phone Screen Experience: Prefix Trie Problem and Interview Insights
Interview Experience
I was asked two questions. The first one was too easy, and I can't quite remember it, so I'm posting the second one instead. The following content requires a score higher than 150. You can already vie
Full Details
I was asked two questions. The first one was too easy, and I can't quite remember it, so I'm posting the second one instead. The following content requires a score higher than 150. You can already view it. Two arrays: Find the longest prefix in the first array, given the elements in the second array. I used a trie. All the elements in the first list were added to the trie. For each element in the second list, I just searched the trie. The questions were really friendly, nothing complicated. I remember having to write the test cases myself. Less than an hour after the interview, I was notified that I was moving on to the
next round. Please share your interview experiences! Thank you everyone.
About This Question
This is a candidate experience report from a bytedance interview for a swe role during the phone screen round reported in 2025.
It covers the following topics: Array, Trie, Arrays, Trie .
Difficulty rating: Easy