Microsoft SDE Intern Interview Experience
💼 LTIMindtree Interview Experience (On-Campus) | Fresher | 2026
Salesforce SMTS | Interview Experience | Rejected
JPMC | SDE2 (Associate) - Java Backend - Interview Experience + Compensation
Microsoft - SDE2 - Coding Round
BharatPe - SDE3 - Feb 2025 - Interview Experience
Summary
I interviewed at BharatPe for an SDE3 role in February 2025. The first round was DSA, where I was presented with a problem to minimize the sum of daily maximum lecture complexities, which I was unable to resolve, leading to my rejection.
Full Experience
Bharatpe:
1st round: DSA
Given Complexities of lectures like {10,20,30,40,50} n is total no. of lectures, here n = 5 You can take upto n-1 lectures per day, not all Needs to be completed in such a way, Total sum of max per day complexity should be minimum
Like let's suppose I'm taking lectures on Day 1 {10,20,30} then 30 is max and next day {40,50} the max is 50 Total sum = 30 + 50 = 80
Like that we need to find minimum.. {10}, {20,30,40,50} = 10 + 50 = 60
Number of days were not given..
Couldn't resolve it ... Rejected.
Interview Questions (1)
Given complexities of lectures like {10,20,30,40,50}. n is the total number of lectures, here n = 5. You can take up to n-1 lectures per day, but not all. The lectures need to be completed in such a way that the total sum of the maximum complexity per day should be minimum.
For example, if I'm taking lectures on Day 1 {10,20,30}, then 30 is the max. On the next day {40,50}, the max is 50. Total sum = 30 + 50 = 80.
Another example: {10}, {20,30,40,50} = 10 + 50 = 60.
We need to find this minimum sum. The number of days were not given.