Bajaj Electricals Ltd interview experience Real time questions & tips from candidates to crack your interview

React developer

Bajaj Electricals Ltd
upvote
share-icon
4 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 1 month
Topics: Data structures, ReactJs, OOPS, DBMS and MySQL
Tip
Tip

Tip 1 : If you are applying for a specific role, make sure you know about that technology in-depth.
Tip 2 : Go through the basics of DBMS and MySQL.

Application process
Where: Campus
Eligibility: NA
Resume Tip
Resume tip

Tip 1 : Have some quality projects which are relevant to your skills on resume.
Tip 2 : Always mention the skills, projects and internships which you are completely aware of.

Interview rounds

01
Round
Easy
Assignment
Duration120 minutes
Interview date16 Aug 2021
Coding problem1

1. Assignment

We were asked to send our personal details like email, reg no, mobile number using an api.

02
Round
Easy
Online Coding Interview
Duration120 minutes
Interview date16 May 2022
Coding problem1

1. DBMS Question

Difference between truncate and delete?

03
Round
Easy
Video Call
Duration30 minutes
Interview date16 Aug 2021
Coding problem1

1. Triplets with Given Sum

Moderate
15m average time
85% success
0/80
Asked in companies
IntuitSamsungGrofers

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Problem approach

Hashing based solution.This approach uses extra space but is simpler than the two-pointers approach. Run two loops outer loop from start to end and inner loop from i+1 to end. Create a hashmap or set to store the elements in between i+1 to j-1. So if the given sum is x, check if there is a number in the set which is equal to x – arr[i] – arr[j]. If yes print the triplet.

Try solving now
04
Round
Easy
HR Round
Duration5 minutes
Interview date16 Aug 2021
Coding problem1

1. Basic HR Questions

Asked if the joining location is ok. HR also told about the company and work culture.

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
SDE - 1
2 rounds | 4 problems
Interviewed by Bajaj Electricals Ltd
2773 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 1 problems
Interviewed by Bajaj Electricals Ltd
1835 views
1 comments
0 upvotes
company logo
Data Scientist
4 rounds | 5 problems
Interviewed by Bajaj Electricals Ltd
1812 views
0 comments
0 upvotes
company logo
SDE - Intern
5 rounds | 7 problems
Interviewed by Bajaj Electricals Ltd
1836 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
React developer
3 rounds | 19 problems
Interviewed by Ernst & Young (EY)
4501 views
0 comments
0 upvotes