DSA Doctor
Verified Company Vault
Bytedance DSA Interview Questions
66 curated coding interview questions directly asked in Bytedance technical rounds, sorted by frequency with recency and difficulty diagnostics.
66
Total Questions
5 (8%)
Easy Problems
52 (79%)
Medium Problems
9 (14%)
Hard Problems
🔥 Most Tested Topics:
Arrays (21)Core DSA (17)Strings (9)Trees (7)Linked List (6)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 100.0% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | 6m |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 87.5% | 6m |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 87.5% | 6m |
| 721 | Accounts Merge | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 87.5% | 6m |
| 450 | Delete Node in a BST | Medium | Trees | DFS / BFS | 54.7% | 87.5% | 6m |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 87.5% | 6m |
| 1997 | First Day Where You Have Been in All the Rooms | Medium | Core DSA | Implementation / Reasoning | 40.4% | 87.5% | all |
| 316 | Remove Duplicate Letters | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 53.2% | 87.5% | all |
| 1081 | Smallest Subsequence of Distinct Characters | Medium | Strings | Hashing / Sliding Window | 63.4% | 87.5% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 75.0% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 75.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 62.5% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 62.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 62.5% | all |
| 10 | Regular Expression Matching | Hard | Core DSA | Implementation / Reasoning | 31.0% | 62.5% | all |
| 2502 | Design Memory Allocator | Medium | Design | Data Structure Design | 50.1% | 62.5% | all |
| 934 | Shortest Bridge | Medium | Core DSA | Implementation / Reasoning | 59.5% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 50.0% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 50.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 50.0% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 50.0% | all |
| 148 | Sort List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 64.4% | 50.0% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 50.0% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | all |
| 317 | Shortest Distance from All Buildings | Hard | Core DSA | Implementation / Reasoning | 44.9% | 50.0% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 50.0% | all |
| 1530 | Number of Good Leaf Nodes Pairs | Medium | Trees | DFS / BFS | 71.8% | 50.0% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 50.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 50.0% | all |
| 40 | Combination Sum II | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 59.5% | 50.0% | all |
| 939 | Minimum Area Rectangle | Medium | Arrays | Sorting / Prefix / Scan | 55.4% | 50.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 50.0% | all |
| 1143 | Longest Common Subsequence | Medium | Core DSA | Implementation / Reasoning | 59.2% | 50.0% | all |
| 240 | Search a 2D Matrix II | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 57.3% | 50.0% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 50.0% | all |
| 407 | Trapping Rain Water II | Hard | Core DSA | Two Pointers | 64.1% | 50.0% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 50.0% | all |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 50.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 50.0% | all |
| 78 | Subsets | Medium | Backtracking | Backtracking | 82.3% | 50.0% | all |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 50.0% | all |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium | Arrays; Trees; Linked List | Sorting / Prefix / Scan; DFS / BFS; Two Pointers | 53.2% | 50.0% | all |
| 402 | Remove K Digits | Medium | Core DSA | Implementation / Reasoning | 36.9% | 50.0% | all |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 50.0% | all |
| 662 | Maximum Width of Binary Tree | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 45.6% | 50.0% | all |
| 133 | Clone Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.3% | 50.0% | all |
| 92 | Reverse Linked List II | Medium | Linked List | Two Pointers | 51.5% | 50.0% | all |
| 43 | Multiply Strings | Medium | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 50.0% | all |
| 2134 | Minimum Swaps to Group All 1's Together II | Medium | Arrays | Sorting / Prefix / Scan | 65.6% | 50.0% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 50.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 3043 | Find the Length of the Longest Common Prefix | Medium | Core DSA | Implementation / Reasoning | 62.2% | 50.0% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 50.0% | all |
| 1352 | Product of the Last K Numbers | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 50.0% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 50.0% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 50.0% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 50.0% | all |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 50.0% | all |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Trees | DFS / BFS | 63.7% | 50.0% | all |
| 16 | 3Sum Closest | Medium | Arrays | Sorting / Prefix / Scan | 48.6% | 50.0% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 50.0% | all |
| 142 | Linked List Cycle II | Medium | Linked List | Two Pointers | 57.9% | 50.0% | all |