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

SDE - Intern

Bain
upvote
share-icon
2 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Journey
I started my DSA journey in the second year of my graduation. I solved questions on coding platforms, totalling over 1000 DSA questions, and also participated in contests. However, DSA alone is not enough to crack a company, so I also studied computer fundamentals such as OOPs, DBMS, OS, and CN. Since most startups required development skills, I worked on some web development projects based on the MERN stack.
Application story
I applied through campus recruitment and completed an online assessment with several data structures and algorithms (DSA) questions, which I managed to solve within the allotted time. Following that, I was shortlisted for an interview process consisting of three rounds: one technical interview, one group discussion, and one HR interview.
Why selected/rejected for the role?
I was rejected due to my low CGPA, even though my interview went very well and the interviewer appreciated my performance. BAIN was very particular about the CGPA and only shortlisted students with a CGPA greater than 8.6.
Preparation
Duration: 20 months
Topics: Data Structure, OOP, DBMS, Computer Networks, Operating System, ReactJS, MongoDB, NodeJS, SQL
Tip
Tip

Tip 1: Be consistent in solving DSA questions daily (e.g., 500 questions).

Tip 2: Try to solve a question before jumping to the solution.

Tip 3: To learn development, don't just watch tutorials—create as many projects as you can.

Application process
Where: Campus
Eligibility: 6 CGPA (Salary Package - 40K Stipend + 14 LPA full time)
Resume Tip
Resume tip

Tip 1: Have a good knowledge of web development.

Tip 2: Develop good communication skills.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date8 Dec 2023
Coding problem2

Then there were 2 DSA questions and 15 MCQ questions. The camera and mic were on.

1. Closest Number

Easy
15m average time
85% success
0/40
Asked in companies
MicrosoftArcesiumExpedia Group

Two positive integers are given n and m.num1: The sum of all integers from 1 to n that are not divisible by m.num2: The sum of all integers from 1 to n that are divisible by m.The task is to calculate and return the difference num1 - num2.

Problem approach

We can use the sum of integers in the range [1, n] as n * (n + 1) / 2.

Try solving now

2. Partition to K equal sum subsets

Moderate
40m average time
70% success
0/80
Asked in companies
Goldman SachsMicrosoftDunzo

Given an integer array nums and an integer k, determine if it is possible to partition the array into k non-empty subsets where each subset has the same sum. Return true if such a partition is possible; otherwise, return false.

Problem approach

We can first determine the target sum that each subset must achieve. Then, we use a recursive approach to explore possible partitions. In each recursive call, we decide which of the k subsets the next value will be added to.

Try solving now
02
Round
Medium
Face to Face
Duration45 minutes
Interview date14 Dec 2023
Coding problem5

This round covered a wide range of questions, including 1 DSA problem, 1 SQL question, 2 questions on ReactJS, and 1 question on OOPs.

1. Merge Intervals

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

You are given an array of intervals, where each interval is represented as [start, end]. Your task is to merge all overlapping intervals. After merging, return an array consisting of the non-overlapping intervals that cover all the intervals in the input.

Problem approach

First, handle the base case of an empty input by returning []. Sort the intervals, then merge overlapping intervals by updating the endpoint. Add non-overlapping intervals directly to the result.

Try solving now

2. Second Highest Salary

SQL query to find the second-highest salary from an employee table. (Practice)

Problem approach

Tip 1: Should have a good grasp on Subqueries.
Tip 2: Should know how to use OrderBy.
 

3. ReactJS

What are Props in ReactJs? (Learn)

Problem approach

Tip 1: Should have a basic understanding of ReactJs.
Tip 2: Should have a project built on ReactJs.
 

4. ReactJS

Can we pass the data without using props?

Problem approach

Tip 1: Should know Context API.
Tip 2: Should have a basic understanding of React Redux.
 

5. Object Oriented Programming

Difference between Compile time and run time polymorphism. (Learn)

Problem approach

Tip 1: Should have knowledge of Object Oriented Programming.
Tip 2: Should know the basic fundamentals.
 

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
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
961 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
3688 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Arcesium
2650 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by BNY Mellon
2324 views
0 comments
0 upvotes