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 Interview Experience (Aug 2025)
Summary
Applied for a role at Amazon and faced an OA with two problems. The first was a system capability calculation with a threshold check, and the second involved forming the largest ring of numbers with specific constraints. In the DSA round, encountered a topological sort with priority queue and a next greater lexicographic string problem. Overall, the interview process ended with a rejection.
Full Experience
Recently, I went through the Amazon interview process for a role at Amazon. The first round was the Online Assessment (OA) where I faced two problems. The first problem involved calculating the system capability after a series of operations on servers, with a requirement to check if it exceeds a threshold. The second problem was about forming the largest ring of numbers with specific constraints, though I couldn't remember the exact details. In the DSA round, I encountered a topological sort problem with priority queue considerations and a next greater lexicographic string problem. I solved the first problem comfortably but struggled with the second. The interview process concluded with a rejection.
Interview Questions (4)
We are given n servers, each with their individual capabilities. We are given n operations where we change the capability of one of the servers. The goal is to determine if the system capability, which is the total sum of all server capabilities, is greater than a threshold after the nth operation. The expected time complexity is O(n).
Forming the largest ring of numbers given that the difference between two consecutive numbers should be less than or equal to 1. The exact problem details and test cases are not recalled, but the core requirement was to ensure the sequence adheres to the specified constraints.
We are given a 2D array representing dependencies of tasks, each with a numeric priority. The task is to determine the order of execution, prioritizing tasks with lower priority first, and in case of ties, the task with the lower ID should be executed first.
Given a set of strings and a new string, determine the next greater lexicographic string in the set. The solution should efficiently find the next string in lexicographic order.