1p3a Question · Sep 2025

ByteDance 2026 Summer Intern Tech Phone Screen Experience

SWE Phone Screen Intern Easy
1 reply

Question Details

Please give me some points, thank you!! The interviewer was very serious and unsmiling. First, I introduced myself, then he gave me a question about k most frequent elements. I initially wrote it usin

Full Details

Please give me some points, thank you!! The interviewer was very serious and unsmiling. First, I introduced myself, then he gave me a question about k most frequent elements. I initially wrote it using a hashmap and sort, then planned to optimize it with quick select. I was interrupted, who said quick select wouldn't optimize time complexity. I vaguely remembered LeetCode editorial saying quick select could average O(n), so I explained. The interviewer insisted I think of another method. At this point, I was interrupted several times and was completely confused. He reminded me that I used a heap, and I frantically modified it twice before it

passed the test case. Then he started scrutinizing my resume. He asked if I used authentication in my Spring Boot project, which I said no. How do you debug latency with two servers?

Time complexity of accessing data via indexing on a relational database? HTTP error codes? I answered some, but not others because they weren't covered in my projects. Self-reflection: It was my first interview, so I was a bit nervous and my basic knowledge was weak. Even a very simple question wasn't bug-free.

About This Question

This is a reported interview question from a bytedance interview for a swe role (intern level) during the phone screen round reported in 2025.

It covers the following topics: Hash Table, Heap, Heap, Sql, Sorting, Hash Table .

Difficulty rating: Easy