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

SDE - Intern

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

Interview preparation journey

expand-icon
Preparation
Duration: 6 Months
Topics: Data Structures and Algorithms, OOPs, DBMS, OS, Personal Projects
Tip
Tip

Tip 1 : Practice DSA daily
Tip 2 : Work on your projects
Tip 3 : Fundamental concepts on core subjects

Application process
Where: Campus
Eligibility: Min 60% in 10th and 12th and above 7 CGPA in UG
Resume Tip
Resume tip

Tip 1 : Mention your Skills and Projects
Tip 2 : Keep it simple and one page resume is enough

Interview rounds

01
Round
Easy
Assignment
Duration15 Minutes
Interview date18 Sep 2021
Coding problem1

10 MCQ question on Kotlin and 2 DSA questions

1. DFS Traversal

Moderate
35m average time
65% success
0/80
Asked in companies
SamsungIntuitGoldman Sachs

Given an undirected and disconnected graph G(V, E), containing 'V' vertices and 'E' edges, the information about edges is given using 'GRAPH' matrix, where i-th edge is between GRAPH[i][0] and GRAPH[i][1]. print its DFS traversal.

V is the number of vertices present in graph G and vertices are numbered from 0 to V-1. 

E is the number of edges present in graph G.
Note :
The Graph may not be connected i.e there may exist multiple components in a graph.
Try solving now
02
Round
Hard
Online Coding Interview
Duration90 Minutes
Interview date18 Sep 2021
Coding problem2

MCQ(10 questions), DSA(2 questions)

1. Split the given array into K sub-arrays

Hard
15m average time
85% success
0/120
Asked in companies
AmazonTekion CorpTrilogy Innovations

You’re given an array 'arr' of size 'n' and an integer 'k'.

Your task is to split 'arr' into 'k' sub-arrays such that the maximum sum achieved from the 'k' subarrays formed must be the minimum possible.

A subarray is a contiguous part of the array.

Return the minimum possible value of the maximum sum obtained after splitting the array into 'k' partitions.


Example:
Input: ‘arr’ = [1, 1, 2] and ‘k’ = 2 

Output: 2

Explanation: If we want to make two subarrays, there are two possibilities: [[1], [1, 2]] and [[1, 1], [2]]. We can see that the maximum sum of any subarray is minimized in the second case. Hence, the answer is 2, which is the maximum sum of any subarray in [[1, 1], [2]].


Try solving now

2. Longest Increasing Subsequence

Moderate
30m average time
65% success
0/80
Asked in companies
PhonePeChegg Inc.Barclays

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.
Try solving now
03
Round
Medium
Video Call
Duration45 minutes
Interview date20 Sep 2021
Coding problem1

They asked some DSA questions and some questions on my projects.

1. Kevin And His Cards

Easy
20m average time
80% success
0/40
Asked in companies
Dell TechnologiesAdobeAmazon

Kevin has two sorted packs of cards. The first pack has N cards and the second one has M cards. Every card has an integer written on it. Now, you have to tell two things. First, how many different types of cards does Kevin have with both packs(union). Second, how many types both the packs have in common(intersection).

Note :
Two cards are said to be of different types if they have different numbers written on them.
Try solving now
04
Round
Easy
HR Round
Duration15 minutes
Interview date21 Sep 2021
Coding problem1

1. Basic HR Questions

What are your strengths and weakness?
Why do you want to join Bajaj Finserv?
What are your short term and long term goals?
Are you willing to relocate to Pune?

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 - Intern
1 rounds | 1 problems
Interviewed by Bajaj Electricals Ltd
1653 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
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15480 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15338 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10142 views
2 comments
0 upvotes