Bytedance Software Engineer Coding & Algorithms Interview Questions
Practice 36 real Coding & Algorithms interview questions for Software Engineer roles at Bytedance.
"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"
"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"
"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."
"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."
"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."
"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."
"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."
"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."
"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."
"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."
"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."
"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."
"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."
"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Remove Duplicate Letters Lexicographically
Remove Duplicate Letters Lexicographically Given a lowercase string, remove repeated occurrences so that every distinct letter appears exactly once. T...
Reverse Nodes in Groups of K
This question evaluates a candidate's ability to manipulate linked list pointers in place, handling in-group reversal while preserving overall structu...
Return the Most Frequent Integer with a Stable Tie-Breaker
Return the Most Frequent Integer with a Stable Tie-Breaker Given a nonempty integer array, return the value that appears most often. If several values...
Equalize Root-to-Leaf Sums in an N-ary Tree
Equalize Root-to-Leaf Sums in an N-ary Tree You are given a rooted tree. Node i has nonnegative value values[i]. In one operation, you may increase on...
Minimize Increments to Equalize Path Costs
This question evaluates understanding of tree data structures, root-to-leaf path aggregation, and cost-balancing strategies within the Coding & Algori...
Implement Sliding Windows and LRU Cache
You are given two coding tasks. Task 1: Longest Subarray of Ones Given a binary array nums and an integer k, return the maximum length of a contiguous...
Find LCA With Parent Pointers
This question evaluates understanding of tree data structures and ancestor relationships, focusing on lowest common ancestor reasoning with parent poi...
Least Frequently Used (LFU) Cache
This question tests practical data structure design by requiring an O(1) implementation of a Least Frequently Used cache with tie-breaking by recency....
Reverse Nodes in K-Sized Groups
This question evaluates skills in manipulating singly linked lists, pointer reassignments, and performing in-place group transformations while meeting...
Reverse a Singly Linked List
This question evaluates a candidate's grasp of linked list pointer manipulation and in-place data structure transformation. It tests the ability to re...
Reverse Linked List Groups
This question evaluates linked list manipulation, pointer/reference management, in-place iterative algorithms, and the ability to enforce O(1) extra s...
Find Maximum Candies With Two Types
You are given a row of candies represented by an array candies, where candies[i] is the type of the candy at position i. You may choose any starting p...
Solve String Addition and Expression Evaluation
This question evaluates string manipulation and parsing skills for numeric computation, covering addition of integers represented as character arrays ...
Implement Expiring LRU Cache
Implement an in-memory key-value cache with least-recently-used eviction and per-entry expiration. The cache has a fixed positive capacity. Each inser...
Solve interval merging and histogram area
The coding round included two algorithm problems: 1. Merge overlapping intervals: Given a list of closed intervals [[start1, end1], [start2, end2], .....
Implement Interval Insert and Dedup
This question evaluates skills in array and interval data-structure manipulation, in-place modification under space constraints, and general algorithm...
Solve Sliding Window and Grid Search
This question evaluates proficiency in string algorithms and constrained shortest-path/search problems, covering sliding-window techniques for bounded...
Count Target-Sum Paths in an N-ary Tree
This question evaluates a candidate's competency in tree data structures and traversal algorithms, specifically counting path sums in N-ary trees and ...
Solve these string, subset, and date problems
You are asked to solve multiple coding tasks. 1) Reverse word order in a string - Input: a string s containing words separated by spaces (may contain ...
Find the Minimum Number of Meeting Rooms
Find the Minimum Number of Meeting Rooms You are given meeting intervals [start, end], where start < end. A room can host at most one meeting at a tim...