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
Amazaon-SDE1(FTC)-INTERVIEW(Rejected in Last HM Round)
Summary
I interviewed for an SDE1(FTC) position at Amazon, undergoing two technical coding rounds and a final Hiring Manager round. I was ultimately rejected after the HM round, possibly due to taking too long on a coding question and the manager not having time for all leadership principle questions.
Full Experience
All the interview Rounds took place on their own platform amazon chime
Interview Round1(Taken by sde1 with 2.5 yrs of experience):
Asked aboout my work in previous organization, One Amazon principle problem : asked about that have you ever solved customer's problem(need to answer using STAR method)
- Coding question 1 : Remove all adjacent duplicates- II(Leetcode : 1209)
- Coding quetsion 2 : First Negative element in window of size K(only optimized intution and no code)
Interview Round2(Taken by sde2 with 4.5 years of experience) :
One Amazon principle problem : Have you ever workd as a leader in your team(need to answer using STAR method)
- Coding question 1 : Given an array, arr[] of rod lengths, weld all rods into a single rod with the minimum total cost. The cost to weld two rods is the sum of their lengths. Input: arr[] = [4, 3, 2, 6] Output: 29
- Coding question 2 : You are given an array balls where balls[I] is the weight of the ith ball, and an infinite number of boxes where each box can carry a maximum weight of limit. Each box carries at most two balls at the same time, provided the sum of the weight of those balls is at most limit. Return the minimum number of boxes to carry every given ball. Example 1: Input: balls = [1,2], limit = 3 Output: 1 Explanation: 1 box (1, 2) Lastly she asked me to write pseudocode for any sorting algo and i wrote code of Merge sort(As i solved both the questions in 45 mins in second round)
Both the rounds happened in a same day with gap of only one hour
After two days hr scheduled my final HM round with 7 yrs experience Manager
Final HM Round : HM joined 8 mins late, Asked about my project on which i had worked on in my previous organization Coding question : Design LRU Cache(Leetcode)
I was able to code it using a hashmap and doubly linkedlist but it took me around 35-40 mins to completely code, explain and dry run on the testcases he provided. He had to asked 2 more leadership principle questions but only 5 mins left and he told me that he had some other meeting.
The very next day HR told me that i am rejected sadly. I did'nt ask the reason but it might be that i had taken a lot of time in coding the question and also he could'nt ask the leadership principle questions which definetely had a lot weightage in all the interview rounds.
Ps : Pre code : In all the above rounds the interviwers firsly asked the intution, will make you understand the question, will ask to optimize and then code. Post code : They asked to write Time and space complexity
Atlast the simple advice from my side would be to keep in mind about the time management as all interviews were around for 1 hr and if you are able to code all questions within 40-45 mins(wich i did in my previous rounds) you woud create a positive impact as interviwers will get time to discuss leadership principle questions and about your work.
Hope it Helps!! All the best!!
Interview Questions (8)
Describe a situation where you had to solve a customer's problem. (Need to answer using STAR method)
Find the first negative element in window of size K (only optimized intuition and no code was required).
Describe a situation where you have worked as a leader in your team. (Need to answer using STAR method)
Given an array, arr[] of rod lengths, weld all rods into a single rod with the minimum total cost. The cost to weld two rods is the sum of their lengths. Input: arr[] = [4, 3, 2, 6] Output: 29
You are given an array balls where balls[I] is the weight of the ith ball, and an infinite number of boxes where each box can carry a maximum weight of limit. Each box carries at most two balls at the same time, provided the sum of the weight of those balls is at most limit. Return the minimum number of boxes to carry every given ball. Example 1: Input: balls = [1,2], limit = 3 Output: 1 Explanation: 1 box (1, 2)
Write pseudocode for any sorting algorithm.