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

SDET-2

BYJUS
upvote
share-icon
3 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 8 months
Topics: Data Structure and Algorithm, OOPS, Database, SQL, HTML, CSS
Tip
Tip

Tip 1 : Practice question on your preferred website regularly.
Tip 2 : You can start from basics and later can shift for competitive coding
Tip 3 : Complete OS, CN, DBMS topics properly if you,re from CS,IT branch. It helps.

Application process
Where: Campus
Eligibility: 6 CGPA, 60%, No Backlogs
Resume Tip
Resume tip

Tip 1 : Single Page
Tip 2 : Go all out with whatever you have got with proper guidance of any senior.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date7 Dec 2021
Coding problem1

It was in the evening. 90 mins round. Moderate Aptitude question. 1 easy coding question and 1 difficult coding question.

1. Reverse A LL

Moderate
30m average time
65% success
0/80
Asked in companies
PhonePeMicrosoftHCL Technologies

Ninjas is practicing problems on the linked list. He came across a problem in which he has given a linked list of ‘N’ nodes and two integers, ‘LOW’ and ‘HIGH’. He has to return the linked list ‘HEAD’ after reversing the nodes between ‘LOW’ and ‘HIGH’, including the nodes at positions ‘LOW’ and ‘HIGH’.

Try solving now
02
Round
Hard
Online Coding Test
Duration65 minutes
Interview date9 Jun 2022
Coding problem1

Technical Interview

1. Ancestors in Binary Tree

Moderate
20m average time
80% success
0/80
Asked in companies
Morgan StanleyShareChatBYJUS

You are given a binary tree with ‘N’ number of nodes and a node ‘K’.Your task is to print a list of all the ancestors of the given node ‘K’ in reverse order (lowest ancestor first).

A binary tree is a hierarchical data structure in which each node has at most two children.

Example:

Here, for ‘k’ = 7, the output will be 14 12 10.
Problem approach

The idea is to traverse the tree in a post order fashion and search for a given node in the tree. For any node, if the given node is found in either its left subtree or its right subtree, then the current node is an ancestor of it. 

Try solving now
03
Round
Medium
HR Round
Duration35 minutes
Interview date10 Jun 2022
Coding problem1

It was Managerial round for around 30 mins. It was mainly focused on team building, decision making and my projects

1. Basic HR Questions

What is your biggest achievement so far?

Just describe your project

 

Problem approach

Tip 1 : Just be truthful
Tip 2 : Answer the questions in a positive way.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
MTS 1
3 rounds | 7 problems
Interviewed by BYJUS
625 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by BYJUS
546 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by BYJUS
586 views
0 comments
0 upvotes
company logo
MTS
2 rounds | 2 problems
Interviewed by BYJUS
133 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDET-2
4 rounds | 3 problems
Interviewed by HashedIn
2297 views
0 comments
0 upvotes