ByteDance Software Engineer Onsite Coding Questions
133+ questions from real ByteDance Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.
What does the ByteDance Onsite Coding round test?
The ByteDance onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.
Top Topics in This Round
ByteDance Software Engineer Onsite Coding Questions
This was my first coding interview, and my performance was only so-so. The interviewer was quite serious throughout. They spent about 25 minutes asking questions related to my resume, including many f
TikTok New Grad SDE Round 2 Onsite Interview Experience
You can refer to [the previous round](https://programhelp.net/en/vo/tiktok-vo-interview-experience-bq-coding-assistance/) of interview experience，This round also ended well. The interviewer was Chines
ByteDance Campus Recruitment VO Interview Experience with Five Rounds
After the referral, the recruiter contacted me via email, asking some behavioral questions: "Why us?" / "Why this new opportunity?" (Of course, I need to find a job after graduation). First Round: Des
Tiktok First Round 2-1 level
Not sure how to solve this problem actually... """ Given an integer array nums and an integer k, return the length of the longest subarray of s such that the frequency of...
https://leetcode.com/problems/cheapest-flights-within-k-stops/
Tiktok | Onsite | Evaluate Division
https://leetcode.com/problems/evaluate-division/
I was given a question similar to https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/, elaborated below. You are given an m x n integer matrix grid where each cell is either 0 (empty), 1 (obstacle) or 2...
I received an online asssessment after applying to Bytedance for a Software engineering (backend role) at Singapore. 1st Qn: Find the number of numbers between a lower bound and an upper...
#146 LRU Cache
LeetCode #146: LRU Cache. Difficulty: Medium. Topics: Hash Table, Linked List, Design, Doubly-Linked List. Asked at TikTok in the last 6 months.
#68 Text Justification
LeetCode #68: Text Justification. Difficulty: Hard. Topics: Array, String, Simulation. Asked at TikTok in the last 6 months.
#200 Number of Islands
LeetCode #200: Number of Islands. Difficulty: Medium. Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix. Asked at TikTok in the last 6 months.
#207 Course Schedule
LeetCode #207: Course Schedule. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort. Asked at TikTok in the last 6 months.
LeetCode #253: Meeting Rooms II. Difficulty: Medium. Topics: Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum. Asked at TikTok in the last 6 months.
#739 Daily Temperatures
LeetCode #739: Daily Temperatures. Difficulty: Medium. Topics: Array, Stack, Monotonic Stack. Asked at TikTok in the last 6 months.
#1462 Course Schedule IV
LeetCode #1462: Course Schedule IV. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort. Asked at TikTok in the last 6 months.
#3 Longest Substring Without Repeating Characters
LeetCode #3: Longest Substring Without Repeating Characters. Difficulty: Medium. Topics: Hash Table, String, Sliding Window. Asked at TikTok in the last 6 months.
#15 3Sum
LeetCode #15: 3Sum. Difficulty: Medium. Topics: Array, Two Pointers, Sorting. Asked at TikTok in the last 6 months.
#300 Longest Increasing Subsequence
LeetCode #300: Longest Increasing Subsequence. Difficulty: Medium. Topics: Array, Binary Search, Dynamic Programming. Asked at TikTok in the last 6 months.
LeetCode #827: Making A Large Island. Difficulty: Hard. Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix. Asked at TikTok in the last 6 months.
#56 Merge Intervals
LeetCode #56: Merge Intervals. Difficulty: Medium. Topics: Array, Sorting. Asked at TikTok in the last 6 months.
What to Expect in the ByteDance Onsite Coding Round
The ByteDance Software Engineer Onsite Coding round has a specific calibration purpose distinct from other rounds in the loop. Across 133+ verified reports on LeakCode for this exact round type, the consistent expectations: clear scoping of the problem before diving into a solution, explicit reasoning about complexity, structured handling of edge cases, and the ability to discuss trade-offs between two reasonable approaches.
Reports tagged with the Onsite Coding round at ByteDance show recurring patterns in difficulty and topic distribution. The Onsite Coding round is typically 45-60 minutes; the interviewer is calibrated against a specific rubric. The discriminator between candidates who advance and candidates who do not is rarely the final correctness of the answer. It is the path: did you clarify, did you verbalize your approach, did you handle edge cases, and did you communicate throughout.
How To Prepare for This Specific Round
Filter the questions below to the most recent reports (past 6-12 months). Questions tagged for this exact round type from this exact company at this exact role level are the highest-signal data available. Older reports may reference questions that have since rotated out of the company's pool.
Practice 4-6 representative problems from this set under timed conditions. The goal is not memorization (companies rotate questions); the goal is to internalize the patterns the interviewer typically reaches for and the depth of follow-up to expect. Reports on LeakCode also tag the typical follow-up depth at this round type, which is the discriminating signal between hire and no-hire calibration.
Onsite Coding Round Timing and Format
The Onsite Coding round at ByteDance typically runs 45-60 minutes. Use the first 2-3 minutes to clarify requirements; you should never start coding or designing without verifying the input/output format, constraints, and edge cases out loud. Use the next 5-7 minutes to verbalize your approach before writing any code. The middle 20-30 minutes are implementation. Reserve the final 10 minutes for testing with concrete examples and discussing optimization or trade-offs.
Time budget discipline is one of the most reliable senior-vs-junior discriminators in this round. Strong candidates verbalize where they are in their budget out loud ("I've used about 20 minutes, I have 15 minutes left for testing and one optimization"). This signals engineering maturity to the interviewer and creates positive feedback they can capture in writing.
Common Failure Modes in This Round
Reports tagged "no hire" at ByteDance Software Engineer Onsite Coding commonly cite: coding silently without verbalizing approach, jumping to implementation before clarifying requirements, missing edge cases (empty input, single element, very large input), producing working code that the candidate cannot refactor when asked, and failing to test their solution with concrete examples before declaring done.
The single most predictive failure mode in 2025-2026 reports: not asking clarifying questions. Interviewers at all FAANG companies are explicitly trained to weight this dimension. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's notes.
See All 133 Questions from This Round
Full question text, answer context, and frequency data for subscribers.
Get Access