BYJUS interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
BYJUS
3 rounds | 5 Coding
problems
Rejected
Interview preparation journey
Journey
I started my preparation in the early days of my college when I started practicing the leetcode and the code studio problems. In the end, I have done more than 300 questions on the leetcode platform.
Application story
I applied to this company throw the on-campus opportunity as my college is a tier 1 college this company always visit my college for hire.
Why selected/rejected for the role?
I was rejected because i was not able to explain all the concept with the correct accuracy.
Preparation
Duration: 4 Months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Regarding DSA preparation, I have a theory. 20 percent of the questions will be asked in 80 percent of the interview and 80 percent of the questions will be asked in 20 percent of the interviews. In short, some questions have a very high chance of coming up during the interviews and some have very low chance. We should focus more on the questions that have more chance of coming up in the interview. You can find these questions on Striver SDE Sheet, InterviewBit, Leetcode 100 most liked, Leetcode 100 most important.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Make Sure that your resume is simple and also try to fit all the information on only one page.
Tip 2 : Have at least 2 projects with the latest technologies, Github link of projects should be provided
Interview rounds
01
Round
Medium
Video Call
Duration45 Minutes
Interview date27 Aug 2022
Coding problem2
1. Convert A Given Binary Tree To Doubly Linked List
Moderate
15m average time
80% success
0/80
Asked in companies
Given a Binary Tree, convert this binary tree to a Doubly Linked List.
A Binary Tree (BT) is a data structure in which each node has at most two children.
A Doubly Linked List contains a previous pointer, along with the next pointer and data.
The order of nodes in Doubly Linked List must be the same as Inorder of the given Binary Tree.
The doubly linked list should be returned by taking the next pointer as right and the previous pointer as left.
You need to return the head of the Doubly Linked List.
For the given binary tree :
You need to return the head to the doubly linked list.
The doubly linked list would be: 1 2 3 4 5 and can be represented as:
Problem approach
Given a Binary Tree, convert this binary tree to a Doubly Linked List.
A Binary Tree (BT) is a data structure in which each node has at most two children.
A Doubly Linked List contains a previous pointer, along with the next pointer and data.
The order of nodes in Doubly Linked List must be the same as Inorder of the given Binary Tree.
The doubly linked list should be returned by taking the next pointer as right and the previous pointer as left.
2. Count Leaf Nodes
Easy
10m average time
90% success
0/40
Asked in companies
You are given a Binary tree. You have to count and return the number of leaf nodes present in it.
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child
A node is a leaf node if both left and right child nodes of it are NULL.
Problem approach
You are given a Binary tree. You have to count and return the number of leaf nodes present in it.
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child
A node is a leaf node if both left and right child nodes of it are NULL.
02
Round
Easy
Video Call
Duration45 Minutes
Interview date27 Aug 2022
Coding problem2
1. 0 1 Knapsack
Moderate
0/80
Asked in companies
A thief is robbing a store and can carry a maximum weight of ‘W’ into his knapsack. There are 'N' items available in the store and the weight and value of each item is known to the thief. Considering the constraints of the maximum weight that a knapsack can carry, you have to find the maximum profit that a thief can generate by stealing items.
Note: The thief is not allowed to break the items.
For example, N = 4, W = 10 and the weights and values of items are weights = [6, 1, 5, 3] and values = [3, 6, 1, 4]. Then the best way to fill the knapsack is to choose items with weight 6, 1 and 3. The total value of knapsack = 3 + 6 + 4 = 13.
2. Longest Increasing Subsequence
Moderate
30m average time
65% success
0/80
Asked in companies
For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.
Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.
For example:
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
03
Round
Easy
HR Round
Duration30 Minutes
Interview date27 Aug 2022
Coding problem1
1. Basic HR Questions
Would you lie for the company?
Who has inspired you in your life and why?
What was the toughest decision you ever had to make?
Have you considered starting your own business?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
2 rounds | 4 problems
Interviewed by BYJUS
Rejected
673 views
0 comments
0 upvotes
SDE - 1
2 rounds | 2 problems
Interviewed by BYJUS
Rejected
670 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by BYJUS
Rejected
744 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BYJUS
Selected 566 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes