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
Summary
I interviewed for an SDE 1 position at Amazon, undergoing two rounds involving LeetCode-style problems, LP questions, and an Object-Oriented Design problem. I was ultimately rejected.
Full Experience
1st round: 1 LP question 1st question - Given an n x n matrix and an integer x, find the position of x in the matrix if it is present. Otherwise, print “Element not found”. All elements in the array are sorted in ascending order in row and column.
Sample 2 3 5 7 9 10 11 13 15 17 19 20 21 23 25 27 28 30 31 33 35 37 39 40 41 43 45 47 49 50 44 46 48 51 58 60
ip: 23 op: (3,2)
ip: 4 op: Element not found
2nd question - Given an infinite stream of integers, find the kth largest element at any point of time. Example: [10,20,11,70,50,40,100,5,...] K=3 Output :[-1,-1,10,11,20,40,
2nd round: few LP question
Amazon Warehouses Team uses a software to sort all the incoming online orders based on their priority and stores the information in a database. This information is made available to the packaging system which continuously picks the order with the highest priority and packages it for delivery.
The OrderSortingService has the following functional requirements:
- Support adding new orders continuously coming in from amazon.com.
- Support getting the order with the highest priority.
- Store the incoming orders.
Need to write the code in OOP's way. All the layers required like controller, repository, service.
Not able to complete in time.
Verdict: rejected.
Interview Questions (3)
Given an n x n matrix and an integer x, find the position of x in the matrix if it is present. Otherwise, print “Element not found”. All elements in the array are sorted in ascending order in row and column.
Sample 2 3 5 7 9 10 11 13 15 17 19 20 21 23 25 27 28 30 31 33 35 37 39 40 41 43 45 47 49 50 44 46 48 51 58 60
ip: 23 op: (3,2)
ip: 4 op: Element not found
Given an infinite stream of integers, find the kth largest element at any point of time. Example: [10,20,11,70,50,40,100,5,...] K=3 Output :[-1,-1,10,11,20,40,
Amazon Warehouses Team uses a software to sort all the incoming online orders based on their priority and stores the information in a database. This information is made available to the packaging system which continuously picks the order with the highest priority and packages it for delivery.
The OrderSortingService has the following functional requirements:
- Support adding new orders continuously coming in from amazon.com.
- Support getting the order with the highest priority.
- Store the incoming orders.
Need to write the code in OOP's way. All the layers required like controller, repository, service.