Upload Button Icon Add office photos

ByteDance

Compare button icon Compare button icon Compare

Filter interviews by

ByteDance Software Engineer Interview Questions and Answers

Updated 27 May 2022

ByteDance Software Engineer Interview Experiences

1 interview found

I applied via Approached by Company and was interviewed in Apr 2022. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Microservices in-depth (advantages/disadvantages, service mesh, communication protocol, monitoring, resilience pattern)
  • Q2. Binary search (not joking)
Round 2 - Technical 

(2 Questions)

  • Q1. Programming Language in-depth
  • Q2. Leetcode Hard Largest Miltiple of 3
  • Ans. 

    Given an array of digits, find the largest multiple of 3 that can be formed from the digits.

    • Sort the array in descending order.

    • If the sum of digits is divisible by 3, return the array as a string.

    • If the sum of digits modulo 3 is 1, remove the smallest digit that has a remainder of 1 when divided by 3, or the two smallest digits that have a remainder of 2 when divided by 3.

    • If the sum of digits modulo 3 is 2, remove the ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Just normal LeetCode question (Medium, Hard)

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

8 Questions

  • Q1. Given two “ids” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of mutual friends
  • Ans. 

    Function to return mutual friends given two ids and getFriends(id) function

    • Call getFriends(id) for both ids to get their respective friend lists

    • Iterate through both lists and compare to find mutual friends

    • Return the list of mutual friends

  • Answered by AI
  • Q2. Given an “id” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of “friends of friends” in the order of decreasing number of mutual friends,...
  • Ans. 

    Function to return list of friends of friends in decreasing order of mutual friends

    • Use a set to store all friends of friends

    • Iterate through the list of friends of the given id

    • For each friend, iterate through their list of friends and count mutual friends

    • Sort the set of friends of friends by decreasing number of mutual friends

  • Answered by AI
  • Q3. Given a number of time slots – start time and end time,“a b”, find any specific time with the maximum number of overlapping. After solving the problem I had to prove my solution
  • Ans. 

    Given time slots, find a specific time with maximum overlap. Prove solution.

    • Create a list of all start and end times

    • Sort the list in ascending order

    • Iterate through the list and keep track of the number of overlaps at each time

    • Return the time with the maximum number of overlaps

    • Prove solution by testing with different input sizes and edge cases

  • Answered by AI
  • Q4. Given an array of Integers, find the Longest sub-array whose elements are in Increasing Order
  • Ans. 

    Find the longest sub-array with increasing order of integers.

    • Iterate through the array and keep track of the current sub-array's start and end indices.

    • Update the start index whenever the current element is smaller than the previous element.

    • Update the end index whenever the current element is greater than or equal to the next element.

    • Calculate the length of the sub-array and compare it with the longest sub-array found s

  • Answered by AI
  • Q5. Given an array of Integers, find the length of Longest Increasing Subsequence and print the sequence.
  • Ans. 

    Find the length of longest increasing subsequence and print the sequence from an array of integers.

    • Use dynamic programming to solve the problem

    • Create an array to store the length of longest increasing subsequence ending at each index

    • Traverse the array and update the length of longest increasing subsequence for each index

    • Print the sequence by backtracking from the index with the maximum length

    • Time complexity: O(n^2)

    • Exam...

  • Answered by AI
  • Q6. Given a Sorted Array which has been rotated, write the code to find a given Integer
  • Ans. 

    Code to find a given integer in a rotated sorted array.

    • Use binary search to find the pivot point where the array is rotated.

    • Divide the array into two subarrays and perform binary search on the appropriate subarray.

    • Handle edge cases such as the target integer not being present in the array.

  • Answered by AI
  • Q7. You have a number of incoming Integers, all of which cannot be stored into memory. We need to print largest K numbers at the end of input
  • Ans. 

    Use a min-heap to keep track of the largest K numbers seen so far.

    • Create a min-heap of size K.

    • For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.

    • If the heap size exceeds K, remove the smallest element.

    • At the end, the heap will contain the largest K numbers in the input.

  • Answered by AI
  • Q8. Implement LRU Cache
  • Ans. 

    LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.

    • Use a doubly linked list to keep track of the order of items in the cache

    • Use a hash map to store the key-value pairs for fast access

    • When an item is accessed, move it to the front of the linked list

    • When the cache is full, remove the least recently used item from the back of the linked list and the hash map

  • Answered by AI

Interview Preparation Tips

Round: ONLINE CODING ROUND
Experience: Facebook visited our campus in July, 2012. We had an online coding round hosted on InterviewStreet. We were asked to solve just one problem. The given problem boils down to : Given a undirected graph, source and destination, write the code to find the total number of distinct nodes visited, considering all possible paths.
Tips: Those shortlisted had to fly to Delhi for a Personal Interview. There were four rounds of interview, each of 45 minutes. The questions were simple. But just solving the given problem wasn't enough.

There was much more interaction and short questions asked related to the problem

Round: Technical Interview
Experience: The above mentioned questions wer asked in the interview. For every solution I was asked to write the code on paper. The code should also include the implementation of the data structures used (I used heaps - so I was asked to implement heaps ). They are looking for someone with good problem solving skills and conceptually sound in data structures

College Name: BIT MESRA

Skills evaluated in this interview

Interview Preparation Tips

Round: Resume Shortlist
Experience: You need to submit your CV and they shortlist you on this basis.Fast and accurate coding.
Tips: Clearly specify any technical achievement.

Round: Coding
Experience: You are given 4 hours to solve a few algorithmic questions.Start practicing for this from sometime earlier.
Tips: There are puzzles available on the Facebook page.

Round: Technical Interview
Experience: Three interviews. All almost exclusively technical with 1-2 HR questions.
The questions are mainly algorithmic in nature and you need to code online while talking to them.
Tips: Be as accurate and clean with your code as possible.

General Tips: Be creative while answering the questions. They might ask you questions like 'What changes would you want to make to Facebook?'.
Prepare algorithmic questions for the interviews. Most companies like Facebook, Google, Microsoft and others focus on this.
Technical projects or internships will be beneficial.
Qualifying for or winning programming contests like overnite is very beneficial. Involvement in Social/Cultural activities or sports is not really essential.
Skill Tips: Being good at writing fast and correct code in any language helps a lot.
Skills: Programming
College Name: IIT KHARAGPUR

Interview Questionnaire 

1 Question

  • Q1. Off-campus interviews in Bangalore

Interview Preparation Tips

Round: Test
Experience: Only a few students will get shortlisted who do all the questions correctly.

Round: Other Interview
Experience: First 4 rounds on day 1 and this are just to shortlist for more rounds on some other day.
Tips: They will focus on almost all the concepts of computer science.You need to practice a lot and start it right now. Should be easy if you have prepared well enough. Use your holidays to start preparing for placements.

General Tips: Sooner you start, better your placement will be as lack of practice & last day study works only for exams but never for interviews. You'll get enough time to prepare for interviews once you get shortlisted. Focus on it even if you are placed already.
Skill Tips: They will focus on almost all the concepts of computer science.
Skills: C , Aptitude
College Name: NIT SURATHKAL

I was interviewed in Dec 2016.

Interview Preparation Tips

Round: Technical Interview
Experience: On-site interview (5 hours).

4 back-to-back 45-minute coding interviews, followed by a design interview, with a lunch break with a Googler in the middle.

The first coding interview was a set of (surprisingly) trivial (no algorithms needed) incremental coding questions.

The two next coding interviews were problems straight from the "Cracking the coding interview" book. Even though I divulged that I'd solved pretty much exactly the same problem before, they didn't give me an alternative problem and I quickly coded up a general and optimal solution for the problems. Follow-up in-depth questions were minimal and not hard.

The last coding question was a pure algorithm question related to search trees/tries. No coding required, spent the whole time reasoning about the most effective algorithm. This was a bit of a brain twister.

The design question was related to high-level system design (not OO design) for storage and search in geographic data. Focus was effective search as well as scalability both in traffic and data volumes.

Tips: Read "Cracking the coding interview" or other similar literature. Solve all the problems and you should be good to go. If you solve a bunch of problems at HackerRank (or similar) as well, you'll have the added bonus of training on how to generalize the algorithms.

I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Given a 2d matrix with some D doors and W walls, we need fill distance matrix with minimum distance to the nearest door
  • Ans. 

    Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.

    • Iterate through the matrix and find the doors

    • Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door

    • Update the distance matrix with the minimum distances

  • Answered by AI
  • Q2. Given a read-only array we want to find kth smallest element in unordered array with O(1) space
  • Ans. 

    Find kth smallest element in unordered array with O(1) space

    • Use the QuickSelect algorithm to partition the array and find the kth smallest element

    • Choose a pivot element and partition the array into two subarrays

    • Recursively partition the subarray that contains the kth smallest element

    • Repeat until the pivot element is the kth smallest element

    • Time complexity: O(n) average case, O(n^2) worst case

  • Answered by AI
  • Q3. Design question
  • Q4. Find friends of friend who already are not friends with you
  • Ans. 

    To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.

    • Get your list of friends

    • For each friend, get their list of friends

    • Exclude yourself and your friends from the final list of friends of friends

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Tips: Just walk the interviewer through the solution you're proposing.

Round: Other Interview
Experience: He started with a design question with how to stream an image such that all clients see the same image at the same time. You need to take care of delays, network problems. He kept on adding new elements like compression, streaming, utc time related issues, client rendering delays and so on.

Round: Other Interview
Experience: This was bar-raiser round.

Skills: Design, Algorithms And Data Structures, Graph Theory
College Name: IIT Madras

Skills evaluated in this interview

I was interviewed before Apr 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.

  • Q1. 

    Kth Largest Element Problem Statement

    Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.

    Example:

    Input:
    Array: [2,1,5,6,3,8], K ...
  • Ans. 

    Find the Kth largest element in an array of distinct positive integers.

    • Sort the array in non-increasing order

    • Return the Kth element from the sorted array

    • Handle multiple test cases

  • Answered by AI
  • Q2. 

    Orange Rotting Problem Statement

    Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:

    • Value 0: Represents an empty cell.
    • Value 1: Represents a fresh orang...
  • Ans. 

    The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.

    • Create a queue to store the rotten oranges and their time of rotting.

    • Iterate through the grid to find the initial rotten oranges and add them to the queue.

    • Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.

    • Continue until the queue is empty, ke...

  • Answered by AI
Round 2 - Face to Face 

Round duration - 45 minutes
Round difficulty - Easy

This was a design round.

Interview Preparation Tips

Eligibility criteriaAbove 8 CGPAUber interview preparation:Topics to prepare for the interview - Design, Algorithms And Data Structures, Graph Theory, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. Some question on KMP
  • Q2. Simulation Question
  • Q3. Topological Sort Question

Interview Preparation Tips

Round: Test
Experience: Simple
Tips: Online Coding Questions
Duration: 60 minutes

Round: Technical Interview
Experience: Moderately difficult
Tips: Thorough understanding of all the algorithms is required.

Round: Technical Interview
Experience: Easy
Tips: Need to start a question afresh without attacking it the way you have solved questions in the past

Round: Technical Interview
Experience: Easy/moderately difficult
Tips: The idea was not that easy to click.

Skills: Coding
College Name: IIT BOMBAY
Motivation: Facebook has revolutionised social networking.

Interview Preparation Tips

Round: Test
Tips: Just try coding as much as you can in the four years of graduation.

Round: Interview
Experience: Three Coding Interview and a Behavioral Interview were conducted.
Tips: Try to get some prior knowledge about the company's infrastructure.w

General Tips: Practice as much problems as you can online or offline.
Skill Tips: Coding is the key for any software company.
Skills: Coding
College Name: IIT KHARAGPUR
Motivation: Its the best in business

I was interviewed before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 120 minutes
Round difficulty - Easy

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium levels. Time was enough and no sectional time was present. 1-2 MCQs on SQL was also present.

  • Q1. 

    Boolean Matrix Transformation Challenge

    Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...

  • Ans. 

    Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.

    • Iterate through the matrix to find elements with value 1

    • Store the row and column indices of these elements

    • Update the entire row and column for each element found to be 1

  • Answered by AI
Round 2 - Video Call 

Round duration - 60 minutes
Round difficulty - Easy

It was an online video interview round on HackerEarth with a simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class that required inheritance was asked by the interviewer to write. I was helped by the interviewer if I got stuck somewhere, Some questions on the implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in HyderabadEligibility criteriaAbove 7 CGPAUber interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, Aptitude , Programming Language.Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Clear basics
Tip 2 : Prepare well
Tip 3 : Do at-least 2 projects

Application resume tips for other job seekers

Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly

Final outcome of the interviewSelected

Skills evaluated in this interview

ByteDance Interview FAQs

How many rounds are there in ByteDance Software Engineer interview?
ByteDance interview process usually has 2 rounds. The most common rounds in the ByteDance interview process are Technical.
How to prepare for ByteDance Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at ByteDance. The most common topics and skills that interviewers at ByteDance expect are Java, Algorithms, Android, Data Structures and Kafka.
What are the top questions asked in ByteDance Software Engineer interview?

Some of the top questions asked at the ByteDance Software Engineer interview -

  1. Leetcode Hard Largest Miltiple o...read more
  2. Microservices in-depth (advantages/disadvantages, service mesh, communication p...read more
  3. Programming Language in-de...read more

Tell us how to improve this page.

ByteDance Software Engineer Salary
based on 5 salaries
₹32 L/yr - ₹64 L/yr
563% more than the average Software Engineer Salary in India
View more details
Content Moderator
292 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Quality Analyst
225 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Content Reviewer
84 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

SME
68 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Accounts Manager
48 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare ByteDance with

Facebook

4.3
Compare

TikTok

4.0
Compare

Google

4.4
Compare

Udaan

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview