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
Amazon SDE-1(L4) interview experience- FTC role.
Summary
I applied directly to Amazon and went through multiple interview rounds for an SDE-1 (L4) FTC role. Despite receiving a 'No-Hire' feedback in one round, I successfully navigated the process, including an additional DSA round, and ultimately received an offer.
Full Experience
Sorry for yet another Amazon post guys, just wanted to share my recent Interview experience with Amazon.
I applied directly on carrer portal in last week of February and received test invite in 2nd week of March.
There were two medium leve DSA questions-
1- There are n number of houses in a line at unit distance. An integer array was given representing capacity of router coverage, eg. if capacity=[0,1,2] then it means no router is installed in 0th house, for 1st building router can cover (i-1) to (i+1) house [0 to 2] and 2nd building's router can (i-2) to (i+2) house [0 to 2(beacause 2 is last house)].
There was one more int array given representing number of people living in house. We needed to find out number of house where number of router signals are equal or greater than number of people.
Solved this question using prefix sum.
2- I don't remember exact problem but it was based on custom sort.
Solved both problem within 30 mins.
After two weeks I got call from recruiter that I was selected for interview.
Round-1 [DSA + LP]:
Interviewer started with their introduction and then asked for mine.
After it he given me two problem to solve one by one.
Problem-1: Slight variation of rotting orange problem.
https://leetcode.com/problems/rotting-oranges/description/.
I explained my thought process, few follow-up question like why DFS is not a good approach. He was convinced with my answers and I implemented solution correctly.
Problem-2: https://leetcode.com/problems/merge-k-sorted-lists/.
After a hint I implemented solution correctly.
After this 2 leadership principle question were asked. This is most important. Do not ignore it.
Feedback: Hire
Round-2 [DSA + LP]:
After greetings and all interviewer asked 2 problems.
Problem-1: Given a binary matrix, 0 means obstacle and 1 means path. You need to tell if you can go from top left to bottom right.
I explained my DFS approach, he asked if we can apply BFS. I told my answer and he was convinced.
Problem-2: Given a matrix representing seats of theter and each row will be filed from left to right. Find row with maximum occupancy.
I explained brute force approach (m*n) and then went to check each row with binary search (mlogn). He asked if I can optimise further. I couldn't [It's much easier than I thought. Not sure what happened that Day :XD]. I ended up implementing binary search solution.
Feedback: No-Hire
Anyways Hiring Manager round was scheduled and recruiter told that I need to shine in that round since I've recived no-hire feedback in 1 round.
Round-3 [LP + Project]
After usual greetings and introduction interviewer asked multiple situation based question and how I applied LP in my current organisation. This round was totally focused on Leadership principle.
Feedback: Hire
After this recruiter reached out telling since I've on no-hire tag so they are giving me one more chance and conversion will depend on this round.
Round-4 [DSA, additional round]
Problem-1: https://leetcode.com/problems/sliding-window-maximum/description/
I explained brute force approach first and then optimised with treemap.
Problem-2: It was a medium Binary Search tree based problem.
Feedback: Hire
After completing final round on 28th April I received offer on 20th May. In the meantime I was in regular touch with recruiter.
First time writing interview experience so please execuse for any mistakes. Please comment if I have missed anything to add. I'd happy to help.
Cheers!!!.
Interview Questions (6)
Given n houses in a line at unit distance. An integer array capacity represents router coverage: capacity[i] means a router at house i can cover (i - capacity[i]) to (i + capacity[i]). There is another integer array representing the number of people living in each house. Find the number of houses where the total router signals are equal to or greater than the number of people.
A slight variation of the Rotting Oranges problem. You are given an m x n grid where each cell can have one of three values: 0 representing an empty cell, 1 representing a fresh orange, or 2 representing a rotten orange. Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten. Return the minimum number of minutes that must elapse until no fresh oranges are present. If this is impossible, return -1.
Given a binary matrix, where 0 means an obstacle and 1 means a path. You need to determine if you can go from the top-left cell to the bottom-right cell.
Given a matrix representing seats of a theater, where each row will be filled from left to right. Find the row with the maximum occupancy (i.e., the most filled seats).