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 OA problems SDE Intern (India) - July 2025
Summary
I successfully solved two coding problems during my Amazon SDE Intern Online Assessment for July 2025, which also included behavioral and aptitude questions.
Full Experience
Problem 1
You are given an array sequenceData of length n, where each element is a positive integer.
You can perform the following operation any number of times (including zero):
Choose a prefix of the array (the first s elements where 1 ≤ s ≤ n) that contains no zeros, and Decrease every element in that prefix by 1.
Your task is to perform any sequence of such operations to maximize the number of zeros in the array.
Return the maximum number of zeros that can be achieved.
Problem 2
You are given an array items of length n, where items[i] represents the number of items in the i-th storage bin.
You can perform the following operation any number of times:
Choose the bin with the maximum number of items (if multiple, pick any), Remove 1 item from it and add it to the bin with the minimum number of items (if multiple, pick any).
Your goal is to perform such operations until the difference between any two bins is at most 1.
Return the minimum number of operations required to achieve this balanced state.
SOLVED both of them
The test also included lot of behavorial and aptitiude based questions.
Interview Questions (2)
You are given an array sequenceData of length n, where each element is a positive integer.
You can perform the following operation any number of times (including zero):
Choose a prefix of the array (the first s elements where 1 ≤ s ≤ n) that contains no zeros, and Decrease every element in that prefix by 1.
Your task is to perform any sequence of such operations to maximize the number of zeros in the array.
Return the maximum number of zeros that can be achieved.
You are given an array items of length n, where items[i] represents the number of items in the i-th storage bin.
You can perform the following operation any number of times:
Choose the bin with the maximum number of items (if multiple, pick any), Remove 1 item from it and add it to the bin with the minimum number of items (if multiple, pick any).
Your goal is to perform such operations until the difference between any two bins is at most 1.
Return the minimum number of operations required to achieve this balanced state.