ByteDance Coding Interview Questions
25 ByteDance coding interview problems with full optimal solutions — 10 easy, 11 medium, 4 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an ByteDance interviewer values, and a FAQ section.
Showing 11 problems of 25
- #11mediumfoundational
11. Add Two Numbers
Add two non-negative integers stored as reverse-order linked lists — ByteDance uses it to test edge-case pointer handling before deeper feed-pipeline questions.
- #12mediumfoundational
12. Longest Substring Without Repeating Characters
Find the longest substring with no repeating characters — ByteDance uses it to gauge sliding-window fluency before scaling to user-session deduplication.
- #13mediumfoundational
13. Container With Most Water
Pick two lines that hold the most water — ByteDance uses it to validate two-pointer reasoning before progressing to ranking-score gap problems.
- #14mediumfoundational
14. 3Sum
Return all unique triplets summing to zero — ByteDance uses it to test sort + two-pointer scaffolding and de-duplication discipline.
- #15mediumfoundational
15. Group Anagrams
Cluster anagrams into groups — ByteDance uses it to test hashable-canonical-form thinking before scaling to comment-clustering pipelines.
- #16mediumfoundational
16. Merge Intervals
Merge overlapping intervals into a minimal set — ByteDance uses it to test sort + sweep reasoning before scaling to watch-time aggregation problems.
- #17mediumfoundational
17. Word Break
Decide whether a string can be segmented into dictionary words — ByteDance uses it to probe DP intuition before deeper text-segmentation pipeline questions.
- #18mediumfoundational
18. LRU Cache
Design an LRU cache with O(1) get and put — ByteDance asks this nearly every loop because it mirrors how their video-thumbnail edge cache must evict cold tiles in microseconds.
- #19mediumfoundational
19. Top K Frequent Elements
Return the k most frequent elements in an array — ByteDance uses it as a direct proxy for top-K trending content selection in TikTok feeds.
- #20mediumfoundational
20. Kth Largest Element in an Array
Find the kth largest value in an unsorted array — ByteDance uses it to test heap vs quickselect tradeoffs that show up in their ranking-cutoff systems.
- #21mediumfoundational
21. Number of Islands
Count connected land regions in a grid — ByteDance uses it to test BFS/DFS scaffolding before scaling to user-cluster detection for recommendations.