ByteDance·Software Engineer·Onsite - Coding / Algorithms
Jul 2026
Bytedance SWE coding round, two problems back to back. Both were algorithmic, one binary search and one string multiplication. Felt okay on the first, got a bit tangled explaining complexity on the second.
- Given an array of piles and a maximum number of hours, find the minimum processing speed k such that all piles can be finished within the time limit. Each hour you can process at most k items from one pile.
- Multiply two large non-negative integers represented as strings without converting the full strings to built-in numeric types. Return the result as a string.
“I knew this was binary search pretty quickly, the monotonic property is obvious once you think about it.” The rest of the author's notes on Software Engineer interview at ByteDance, Onsite - Coding / Algorithms round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post