
ByteDance Interview Questions
Curated technical problems, DSA questions & coding interview rounds
Target Role
Software Engineer (SDE I / II)
Problem Count
64+ Verified
Assessment Type
DSA & System Design
Preparation Mode
Live AI Interactive
LRU Cache
MEDIUM
45% Acceptance100% Frequency
Hash Table
Linked List
Design
Doubly-Linked List
Smallest Subsequence of Distinct Characters
MEDIUM
62% Acceptance90% Frequency
String
Stack
Greedy
Monotonic Stack
Remove Duplicate Letters
MEDIUM
51% Acceptance87% Frequency
String
Stack
Greedy
Monotonic Stack
First Day Where You Have Been in All the Rooms
MEDIUM
40% Acceptance87% Frequency
Array
Dynamic Programming
Number of Islands
MEDIUM
62% Acceptance85% Frequency
Array
Depth-First Search
Breadth-First Search
Union Find
Matrix
Course Schedule
MEDIUM
49% Acceptance79% Frequency
Depth-First Search
Breadth-First Search
Graph
Topological Sort
Longest Substring Without Repeating Characters
MEDIUM
37% Acceptance75% Frequency
Hash Table
String
Sliding Window
Combination Sum
MEDIUM
75% Acceptance75% Frequency
Array
Backtracking
Basic Calculator II
MEDIUM
46% Acceptance71% Frequency
Math
String
Stack
Kth Largest Element in an Array
MEDIUM
68% Acceptance71% Frequency
Array
Divide and Conquer
Sorting
Heap (Priority Queue)
Quickselect
Regular Expression Matching
HARD
29% Acceptance71% Frequency
String
Dynamic Programming
Recursion
Two Sum
EASY
56% Acceptance65% Frequency
Array
Hash Table
Shortest Distance from All Buildings
HARD
44% Acceptance65% Frequency
Array
Breadth-First Search
Matrix
House Robber II
MEDIUM
44% Acceptance65% Frequency
Array
Dynamic Programming
House Robber
MEDIUM
52% Acceptance65% Frequency
Array
Dynamic Programming
Longest Consecutive Sequence
MEDIUM
47% Acceptance65% Frequency
Array
Hash Table
Union Find
Merge Intervals
MEDIUM
49% Acceptance65% Frequency
Array
Sorting
Trapping Rain Water
HARD
65% Acceptance65% Frequency
Array
Two Pointers
Dynamic Programming
Stack
Monotonic Stack
Search in Rotated Sorted Array
MEDIUM
43% Acceptance65% Frequency
Array
Binary Search
Longest Common Subsequence
MEDIUM
58% Acceptance58% Frequency
String
Dynamic Programming
Rotting Oranges
MEDIUM
57% Acceptance58% Frequency
Array
Breadth-First Search
Matrix
Best Time to Buy and Sell Stock
EASY
55% Acceptance58% Frequency
Array
Dynamic Programming
Top K Frequent Elements
MEDIUM
65% Acceptance58% Frequency
Array
Hash Table
Divide and Conquer
Sorting
Heap (Priority Queue)
+3 moreAdd Two Numbers
MEDIUM
46% Acceptance58% Frequency
Linked List
Math
Recursion
Maximal Square
MEDIUM
49% Acceptance58% Frequency
Array
Dynamic Programming
Matrix
Combination Sum II
MEDIUM
58% Acceptance58% Frequency
Array
Backtracking
Basic Calculator
HARD
46% Acceptance58% Frequency
Math
String
Stack
Recursion
Insert Delete GetRandom O(1)
MEDIUM
55% Acceptance58% Frequency
Array
Hash Table
Math
Design
Randomized
Subarray Sum Equals K
MEDIUM
45% Acceptance58% Frequency
Array
Hash Table
Prefix Sum
Sum Game
MEDIUM
48% Acceptance58% Frequency
Math
String
Greedy
Game Theory
Number of Good Leaf Nodes Pairs
MEDIUM
72% Acceptance58% Frequency
Tree
Depth-First Search
Binary Tree
Sort List
MEDIUM
62% Acceptance58% Frequency
Linked List
Two Pointers
Divide and Conquer
Sorting
Merge Sort
Delete Operation for Two Strings
MEDIUM
64% Acceptance58% Frequency
String
Dynamic Programming
Open the Lock
MEDIUM
61% Acceptance49% Frequency
Array
Hash Table
String
Breadth-First Search
Container With Most Water
MEDIUM
58% Acceptance49% Frequency
Array
Two Pointers
Greedy
Binary Tree Zigzag Level Order Traversal
MEDIUM
62% Acceptance49% Frequency
Tree
Breadth-First Search
Binary Tree
Trapping Rain Water II
HARD
59% Acceptance49% Frequency
Array
Breadth-First Search
Heap (Priority Queue)
Matrix
Pow(x, n)
MEDIUM
37% Acceptance49% Frequency
Math
Recursion
Next Permutation
MEDIUM
43% Acceptance49% Frequency
Array
Two Pointers
Compare Version Numbers
MEDIUM
42% Acceptance49% Frequency
Two Pointers
String
Design Memory Allocator
MEDIUM
48% Acceptance49% Frequency
Array
Hash Table
Design
Simulation
Search a 2D Matrix II
MEDIUM
55% Acceptance49% Frequency
Array
Binary Search
Divide and Conquer
Matrix
Merge Sorted Array
EASY
53% Acceptance49% Frequency
Array
Two Pointers
Sorting
Peak Index in a Mountain Array
MEDIUM
68% Acceptance49% Frequency
Array
Binary Search
Subsets
MEDIUM
81% Acceptance49% Frequency
Array
Backtracking
Bit Manipulation
Longest Repeating Character Replacement
MEDIUM
57% Acceptance49% Frequency
Hash Table
String
Sliding Window
Merge k Sorted Lists
HARD
57% Acceptance49% Frequency
Linked List
Divide and Conquer
Heap (Priority Queue)
Merge Sort
Unique Paths
MEDIUM
66% Acceptance49% Frequency
Math
Dynamic Programming
Combinatorics
Minimum Window Substring
HARD
45% Acceptance49% Frequency
Hash Table
String
Sliding Window
Sum of Distances in Tree
HARD
65% Acceptance49% Frequency
Dynamic Programming
Tree
Depth-First Search
Graph
Longest Palindromic Substring
MEDIUM
36% Acceptance49% Frequency
Two Pointers
String
Dynamic Programming
Reverse Linked List
EASY
79% Acceptance49% Frequency
Linked List
Recursion
Minimum Area Rectangle
MEDIUM
55% Acceptance49% Frequency
Array
Hash Table
Math
Geometry
Sorting
Add to Array-Form of Integer
EASY
45% Acceptance49% Frequency
Array
Math
Course Schedule II
MEDIUM
53% Acceptance49% Frequency
Depth-First Search
Breadth-First Search
Graph
Topological Sort
H-Index
MEDIUM
40% Acceptance49% Frequency
Array
Sorting
Counting Sort
Decode String
MEDIUM
61% Acceptance49% Frequency
String
Stack
Recursion
Find All Good Indices
MEDIUM
40% Acceptance49% Frequency
Array
Dynamic Programming
Prefix Sum
Degree of an Array
EASY
57% Acceptance49% Frequency
Array
Hash Table
Climbing Stairs
EASY
54% Acceptance49% Frequency
Math
Dynamic Programming
Memoization
Count Binary Substrings
EASY
66% Acceptance49% Frequency
Two Pointers
String
Maximum Value at a Given Index in a Bounded Array
MEDIUM
39% Acceptance49% Frequency
Math
Binary Search
Greedy
Partition to K Equal Sum Subsets
MEDIUM
38% Acceptance49% Frequency
Array
Dynamic Programming
Backtracking
Bit Manipulation
Memoization
+1 moreRemove Zero Sum Consecutive Nodes from Linked List
MEDIUM
53% Acceptance49% Frequency
Hash Table
Linked List
How to Prepare for ByteDance Technical Interviews
1. Master High Frequency DSA
Review the top questions asked in ByteDance coding rounds over the past 3-6 months. Focus on core patterns including Arrays, Hash Tables, Trees, Dynamic Programming, and Graph Traversals.
2. Practice with AI Voice Mock Interviews
Simulate real pressure by practicing voice and video interview loops on Voke with AI calibrated specifically for ByteDance engineering standards and behavioral rubrics.