BYJUS interview experience Real time questions & tips from candidates to crack your interview

MTS

BYJUS

2 rounds | 2 Coding problems

Samridhi Garg

Fresher | Aug 2022

Selected

Interview preparation journey

Journey

After graduating from Thapar University in 2023, I started my career as an intern at Byju's, where I worked for 9 months on backend development and optimizing features for their learning platform. This hands-on experience sharpened my technical skills and problem-solving abilities, preparing me for larger challenges in software engineering.

Application story

I applied for the internship at Byju’s through my university’s placement portal after seeing the job listing. The process began with submitting my resume and filling out an initial application form. After a couple of days, I received an email inviting me to take an online coding assessment, which tested my problem-solving and coding skills. Upon successfully completing the assessment, I was shortlisted for a virtual technical interview. The interview focused on data structures, algorithms, and my understanding of key concepts, along with a few behavioral questions related to my past experiences and motivation. Within a week of the interview, I received an offer for the internship role.

Why selected/rejected for the role?

I was selected for the internship at Byju’s because I demonstrated strong problem-solving skills during the coding assessment and technical interview. My ability to think critically and efficiently solve algorithmic challenges impressed the interviewers. Additionally, I showcased my passion for learning and enthusiasm for the role, which aligned with Byju’s work culture. The selection process highlighted the importance of technical knowledge, time management, and clear communication in solving complex problems, which was a key learning experience.

Preparation

Duration: 1 months

Topics: DP, Arrays & String, Heap, Hashing, Sorting, Graphs & Trees

Tip

Tip 1: Focus on Data Structures and Algorithms.
Tip 2: Take Mock Interviews.
Tip 3: For onsite interviews, maintain a CGPA threshold.

Application process

Where: Campus

Eligibility: 8.5 CGPA (Salary: 22 LPA)

Resume tip

Tip 1: Highlight relevant projects and technical skills that demonstrate your problem-solving abilities. Include projects that directly relate to the role you're applying for, and be sure to mention the tools and technologies you used.
Tip 2: Keep your resume concise and well-structured. Avoid unnecessary details and focus on key achievements, metrics, and skills. Use bullet points for easy readability, and ensure the format is clean and professional.

Interview rounds

Round

Medium

Online Coding Test

Duration90 minutes

Interview date24 Aug 2022

Coding problem1

The coding test for Byju's took place in the afternoon, and I was given a set amount of time to complete it. The test was conducted online, and I took it from the institute lab, which helped me concentrate. The test platform was straightforward to navigate, with a built-in code editor and timer. It focused on problem-solving, data structures, and algorithms, and I had a sufficient amount of time to work through the questions. There were no major technical issues, and the interface was smooth.

Although there was no live interaction during the coding test, the questions were well-designed to assess my logical thinking and coding skills. After completing the test, I received an email within a few days informing me that I had cleared the assessment and was shortlisted for the interview round.

1. Remove Duplicates from Sorted Array

Easy

15m average time

85% success

0/40

Asked in companies

You are given a sorted integer array 'arr' of size 'n'.

You need to remove the duplicates from the array such that each element appears only once.

Return the length of this new array.

Note:

Do not allocate extra space for another array. You need to do this by modifying the given input array in place with O(1) extra memory.

For example:

'n' = 5, 'arr' = [1 2 2 2 3].
The new array will be [1 2 3].
So our answer is 3.

Try solving now

Round

Medium

Video Call

Duration60 minutes

Interview date24 Aug 2022

Coding problem1

The interview round took place in the afternoon, and the environment was entirely virtual. The interviewer was friendly and professional, and the interaction went smoothly. The interview began with a brief introduction and an overview of my resume, followed by technical questions focused on data structures, algorithms, and problem-solving. There was also a coding task where I had to solve a problem on the shared editor. The interviewer gave me time to think through the problem, asked clarifying questions, and encouraged me to explain my thought process clearly. The session concluded with a few behavioral questions and an opportunity to ask questions. The entire process felt engaging, and the interviewer made the experience comfortable.

1. Remove Duplicates

Easy

15m average time

80% success

0/40

Asked in companies

Ninja is playing with numbers but hates when he gets duplicate numbers. Ninja is provided an array, and he wants to remove all duplicate elements and return the array, but he has to maintain the order in which the elements were supplied to him.

Problem approach

Step 1: I started by creating a boolean array visited[] of size 256 to represent all possible ASCII characters (since there are 256 ASCII characters). The array is used to track which characters have been seen before.
Step 2: I iterated through each character of the input string. For each character, I checked if it had already been encountered by looking at its index in the visited[] array.
Step 3: If the character had not been visited yet, I appended it to the result string and marked it as visited by setting visited[character] = true.
Step 4: If the character had been visited, I skipped adding it to the result string.
Step 5: The interviewer confirmed that the solution is efficient because it processes the string once, thus having a time complexity of O(n), where n is the length of the string. The solution does not use any additional complex data structures like hash maps and works in linear time.

Try solving now