Upload Button Icon Add office photos

ByteDance

Compare button icon Compare button icon Compare

Filter interviews by

ByteDance Front end Engineer Interview Questions and Answers

Updated 15 Oct 2024

ByteDance Front end Engineer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Repaint vs reflow
  • Ans. 

    Repaint involves changing the visual appearance of an element, while reflow involves recalculating the layout of elements on the page.

    • Repaint is when changes are made to an element's style that do not affect its layout, such as color or background.

    • Reflow is when changes are made to an element's layout that affect its position or size, triggering a recalculation of the entire page layout.

    • Repaint is less resource-intensi...

  • Answered by AI
  • Q2. Implement debounce

Skills evaluated in this interview

Interview questions from similar companies

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 appeared for an interview 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

I appeared for an interview before May 2021.

Round 1 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Find the k-th Node from the End of a Linked List

    Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...

  • Ans. 

    To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.

    • Iterate through the linked list to determine its size.

    • Calculate the position of the k-th node from the end based on the size of the list.

    • Traverse the list again to reach the k-th node from the end.

    • Return a pointer to the k-th node from the end.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

High level System Design

  • Q1. Can you design a system like Uber, explaining the various components and architecture involved?
  • Ans. 

    Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.

    • User app for booking rides and tracking

    • Driver app for accepting rides and navigation

    • Server for handling requests and communication between apps

    • Database for storing user, driver, and ride information

    • Algorithms for matching riders with drivers and routing

  • Answered by AI
Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

Basic HR questions

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, React JS, JavaScript, DBMS, AlgorithmsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practise DSA/coding consistently
Tip 2 : Choose a tech stack and Make side hobby projects
Tip 3 : Give mock interviews for your preparation evaluation

Application resume tips for other job seekers

Tip 1 : Pointers about your current job responsibility
Tip 2 : Side Projects with Tech stack

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview 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

I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

4 Questions

  • Q1. Y r u choosing this job only??
  • Ans. Because I want to share my ideas and innovative to others and to develop our company in good manner.
  • Answered Anonymously
  • Q2. What's your dream?
  • Q3. My dream is to got a job
  • Q4. How much salary will you expected??

Interview Preparation Tips

Interview preparation tips for other job seekers - My advice is to be positive at any situation and be active .
Don't get feared .
Your dressing is shown ur attitude.
Give respect to the others don't forget these things.

I appeared for an interview before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q2. 

    Find the Second Largest Element

    Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.

    If a second largest element does not exist, return -1.

    Example:

    Input:
    ARR = [2,...
  • Ans. 

    Find the second largest element in an array of integers.

    • Iterate through the array to find the largest and second largest elements.

    • Handle cases where all elements are identical.

    • Return -1 if a second largest element does not exist.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

  • Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
  • Ans. 

    Design a scalable system for Twitter with key components and architecture.

    • Use microservices architecture for scalability and fault isolation.

    • Key components include user service, tweet service, timeline service, and notification service.

    • Use a distributed database like Cassandra for storing tweets and user data.

    • Implement a message queue like Kafka for handling real-time updates and notifications.

    • Use a caching layer like ...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaResume shortlistingSwiggy interview preparation:Topics to prepare for the interview - OOPS, Data Structures, Core Java, Algorithms, DBMS, SQL,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.

Application resume tips for other job seekers

Tip 1 : Mention what you know 
Tip 2 : Good previous work to showcase

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.

  • Q1. 

    Implement indexOf Function

    You are provided with two strings A and B. Your task is to find the index of the first occurrence of A within B. If A is not found in B, return -1.

    Example:

    Input:
    A = "bc", ...
  • Ans. 

    Implement a function to find the index of the first occurrence of one string within another string.

    • Iterate through the second string and check if a substring of the same length as the first string matches the first string.

    • Return the index of the first occurrence of the first string within the second string, or -1 if not found.

    • Handle edge cases like empty strings or when the first string is longer than the second string

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Implement binary search to find the target integer in the rotated array.

    • Handle the rotation by checking which side of the array is sorted before performing binary search.

    • Return the index of the target integer if found, else return -1.

    • Time complexity of O(logN) is required for each query.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .

  • Q1. 

    Distinct Subsequences Problem Statement

    You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.

    Exampl...

  • Ans. 

    Calculate the number of distinct subsequences in a string with possible duplicates.

    • Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.

    • Consider the cases where the current character is included or excluded in the subsequence.

    • Handle duplicates by considering the previous occurrence of the character.

    • Return the count of distinct subsequences modulo 10^9 + 7.

  • Answered by AI
Round 3 - HR 

Round duration - 60 minutes
Round difficulty - Easy

This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Guru Gobind Singh Indraprastha University. I applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAUrban Clap interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPS, Operating System, DBMS, Greedy Algorithms, Computer NetworksTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : I prepared all topics from my Coding Ninjas Course - Competitive Programming
Tip 2 : I practiced 300+ questions on CodeZen ( Coding Ninjas Platform), LeetCode, InterviewBit
Tip 3 : I took part in contests on CodeForces.
Tip 4 : Apart from Data Structures and Algorithms , I also studied DBMS, OOPs and other course subjects

Application resume tips for other job seekers

Tip 1 : Keep Resume up to date for the role you are applying.
Tip 2 : Mention atleast 1 project or past work experience.
Tip 3 : Try to keep a 1 pager resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jul 2024. There were 4 interview rounds.

Round 1 - Coding Test 

It was a coding round where i need to solve 3 DSA Questions in 1.5 hour

Round 2 - Technical 

(2 Questions)

  • Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...
  • Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
Round 3 - One-on-one 

(1 Question)

  • Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...
Round 4 - HR 

(1 Question)

  • Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

In test I had to solve 3 dsa questions in 1 hour

Round 2 - Technical 

(1 Question)

  • Q1. I have asked 2 DSA questions in my interview

ByteDance Interview FAQs

How many rounds are there in ByteDance Front end Engineer interview?
ByteDance interview process usually has 1 rounds. The most common rounds in the ByteDance interview process are Technical.
How to prepare for ByteDance Front end 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 Angularjs, CSS, Es6, HTML and Javascript.
What are the top questions asked in ByteDance Front end Engineer interview?

Some of the top questions asked at the ByteDance Front end Engineer interview -

  1. repaint vs ref...read more
  2. implement debou...read more

Tell us how to improve this page.

ByteDance Front end Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 442 Interviews
Udaan Interview Questions
3.9
 • 338 Interviews
Meesho Interview Questions
3.7
 • 338 Interviews
Zepto Interview Questions
3.5
 • 255 Interviews
BlackBuck Interview Questions
3.8
 • 182 Interviews
Tata 1mg Interview Questions
3.6
 • 159 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
Digit Insurance Interview Questions
3.9
 • 148 Interviews
Paisabazaar.com Interview Questions
3.4
 • 144 Interviews
Urban Company Interview Questions
3.4
 • 137 Interviews
View all
Content Moderator
317 salaries
unlock blur

₹2.7 L/yr - ₹6.5 L/yr

Quality Analyst
244 salaries
unlock blur

₹3 L/yr - ₹9.5 L/yr

SME
149 salaries
unlock blur

₹3 L/yr - ₹9.6 L/yr

Content Reviewer
84 salaries
unlock blur

₹2.2 L/yr - ₹6 L/yr

Accounts Manager
47 salaries
unlock blur

₹7 L/yr - ₹21 L/yr

Explore more salaries
Compare ByteDance with

Facebook

4.3
Compare

Udaan

3.9
Compare

Swiggy

3.8
Compare

BlackBuck

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