ByteDance · Phone screen
Not reportedByteDance TikTok USDS SWE Intern Interview: 1 Experience
A late-2026 TikTok USDS SWE intern video interview at ByteDance with one coding task: a log analyzer for the busiest service in a rolling window.
At a glance
- Process: a video interview with one coding task; the round wasn't named (report 01)
- Asked recently: the log analyzer, a per-service sliding window with ties (report 01)
- Difficulty: the candidate rated the difficulty average and gave no detail
- Practise first: Log Analyzer: Busiest Service in a Rolling Window
Coverage: One candidate for the 2027 TikTok USDS software engineering internship, with a Bachelor's degree, who came in through a referral. The report covers one video interview in late 2026 and went up on November 20, 2026. It gives no location and no result.
What came up
The only task in this report is a sliding-window count over logs, with ties to handle.
| Topic | Reports | Last seen |
|---|---|---|
| Sliding window over timestamped logs | 1 of 1 | Nov 2026 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Log Analyzer: busiest service in a rolling window | 1 | Nov 2026 (report date) |
1 detailed candidate timeline, loops, and screens
01: TikTok USDS SWE intern, video interview
Interview period: 2026 Q4 · Report date: November 20, 2026 · Role: Software engineer intern (2027), TikTok USDS · Degree listed: Bachelor's · Channel: Referral · Candidate's rating: Neutral experience, average difficulty · Result: Not stated
Coding: Log Analyzer
- Each log records the second a request arrived and which service handled it. Given a window length t, work out which service handled the most requests within some stretch of t seconds. The answer is that service plus its count, and every service that ties for the top count has to be returned too. FastPrep's practice version is Log Analyzer: Busiest Service in a Rolling Window.
- The candidate wrote out three examples with their expected outputs. In one, with a 300-second window, a single service reached five requests. In another, with a 10-second window, two services tied at three requests each, so both came back.
- Two details only show up in the examples. The logs are not sorted by time, since one example lists a later request before an earlier one. And a window includes both ends: requests at seconds a and b fall in the same window when b minus a is at most t.
- The report doesn't describe the candidate's approach or say how the round went.
Common questions
What coding question does TikTok USDS ask SWE interns?
One 2027 intern candidate got a log analyzer: pick out the service that handled the most requests within some t-second stretch, and return every service that ties (report 01).
Is the TikTok USDS intern interview on video?
This one was a video interview, and the report doesn't name the round (report 01).
Keep practicing
- Practice question: Log Analyzer: Busiest Service in a Rolling Window (report 01).
- More ByteDance coding questions: the ByteDance coding question bank. It needs sign-in.
- Interview overview: the ByteDance interview questions page.
- Hiring insights: the ByteDance hiring insights page.
- More firsthand reports: browse the Experience feed.
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.