← Back to Directory

ByteDance interview notes, page 16 of 29

FAANG / Big Tech

Most of these ByteDance write-ups come from Software Engineers (194), then Machine Learning Engineers (45) and Data Scientists (17). The most reported rounds are the technical phone screen (227), the system design round (28), the behavioral / leadership round (16) and the onsite coding round (9).

289 interview notes · updated Sep 2026

ByteDance·Machine Learning Engineer·Onsite - System Design / Architecture

May 2026
Bytedance ML Engineer interview with a meaty system design question around fraud detection in e-commerce. Pretty open-ended, which I wasn't fully prepared for.
  • Design a machine learning system to detect self-dealing or wash transactions in an e-commerce marketplace, where sellers use related buyer accounts to fake sales volume, inflate rankings, or generate fraudulent reviews.

“This one sprawled in every direction.”

View Post

ByteDance·Machine Learning Engineer·Technical Phone Screen

May 2026
Bytedance ML engineer interview with a classic DP problem. Nothing too wild, but the LCS question is one where you either know the recurrence or you're fumbling through it live.
  • Given two strings, find the length of their longest common subsequence.

“Classic 2D DP.”

View Post

ByteDance·Software Engineer·Technical Phone Screen

May 2026
Bytedance SWE interview with a grid pathfinding problem that sounds manageable until you realize the state space is three-dimensional. The k-obstacle-removal constraint is what makes it a real question rather than just BFS.
  • Given an m x n grid of empty cells and obstacles, find the shortest path from the top-left to the bottom-right corner where you can remove at most k obstacles along the way. Return the number of steps, or -1 if no path exists.

“My first instinct was plain BFS and I started coding it before catching myself.”

View Post

ByteDance·Software Engineer·Technical Phone Screen

May 2026
Bytedance SWE interview with a sliding window problem that looks straightforward until you actually try to optimize it. One question, but the follow-up pushed for linear time which is where things got interesting.
  • Given an array of candy types, find the maximum number of candies you can collect by moving right from any starting position, subject to the constraint that you can only carry at most two distinct types. Follow-up: can you do it in linear time?

“Sliding window with two pointers, pretty much textbook.”

View Post

ByteDance·Software Engineer·Technical Phone Screen

May 2026
Bytedance SRE coding round, just the one problem but it was N-Queens. Passed two test cases and got through the complexity analysis, so it wasn't a disaster, but I definitely left some edge cases on the table.
  • Solve the N-Queens problem and analyze its time complexity.

“Backtracking problem, classic but still annoying under pressure.”

View Post

ByteDance·Software Engineer·Onsite - Coding / Algorithms

May 2026
Bytedance software engineer interview with a coding problem centered on text formatting logic. The question had enough edge cases to keep things interesting, and the border-wrapping requirement at the end felt like a deliberate gotcha.
  • Given a list of paragraphs each tagged with a left or right alignment flag and a max line width W, implement a greedy word-wrapping algorithm that fits words onto lines without splitting them, pads each line to width W based on alignment direction, and wraps the entire result in a border of asterisks. Return the final formatted page as a string.

“The greedy line-filling part was straightforward enough, just accumulate words until the next one doesn't fit.”

View Post

ByteDance·Data Scientist·Technical Phone Screen

May 2026
Bytedance data scientist interview with a classic probability geometry problem. Pretty clean question but the derivation takes a minute to set up properly if you haven't seen it before.
  • A stick of length 1 is broken at two points chosen independently and uniformly at random. What is the probability that the three resulting pieces can form a triangle?

“I'd seen this problem before so I knew the answer was 1/4, but actually deriving it cleanly under pressure is another thing.”

View Post

ByteDance·Software Engineer·Technical Phone Screen

May 2026
One coding round at Bytedance for a software engineer role, just a single LeetCode problem and that was it.
  • Solve LeetCode 1110: Delete Nodes And Return Forest.

“Tree problem, not the hardest thing in the world but you need to think carefully about when to cut a node and what to do with its children.”

View Post

ByteDance·Software Engineer·Technical Phone Screen

May 2026
Bytedance coding screen, one algorithmic problem about string manipulation. Pretty focused session, nothing behavioral, just the problem and a bit of back and forth on edge cases.
  • You're given two strings of equal length containing only 'x' and 'y'. In a single move, you can swap any character from the first string with any character from the second. What's the minimum number of swaps to make both strings identical, and when is it impossible?

“Took me a minute to realize the impossible case isn't just about counts being off.”

View Post

ByteDance·Software Engineer·Technical Phone Screen

May 2026
Bytedance software engineer coding round, pretty standard algorithms stuff but they pushed on complexity and wanted you to know more than one approach.
  • Given an array of unique integers, return all possible subsets (the power set) with no duplicate subsets.

“I went straight to backtracking, include or exclude at each step and emit the current subset at every node.”

View Post