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
GOLDMAN SACHS Interview Experience (Jun- July 2025)
Summary
I applied to Goldman Sachs, successfully cleared the Online Assessment with two custom coding problems, but unfortunately, I was rejected after the second coding round, where I made a mistake on one of the LeetCode problems (Fraction to Recurring Decimal).
Full Experience
I had applied on 14/06/2025. I got OA link on 25th June 2025. It had 2 questions of easy-med level.
- Persons A and Buses an encryption based system for their conversation. Each conversation message is encoded from the source and decoded in the destination using a shared private positive number key known to each other
2)Given a number 'x', and a range of 'y' , please find the count of all the numbers in' in that range, such that the product of the number 'n' and 'x' does not contain any digit from the number 'n'. General Constraints: All the inputs will be integers and below 10$ E.g., if x = 2, y = 10 and z = 15, then, 2 × 10 = 20 // Invalid, since the product contains 0 from 10. 2 x 11 = 22 // Valid
I was able to answer these.
Round 2: coderpad. 18/07/2025 This round has 1 easy question and 1 med level question.
-
Power question: https://leetcode.com/problems/powx-n/description/?envType=problem-list-v2&envId=n86csxy2
-
Recurring decimal: https://leetcode.com/problems/fraction-to-recurring-decimal/description/?envType=problem-list-v2&envId=n86csxy2
Unfortunately I made some mistake for 2nd question and after few days application got turned down.
Interview Questions (4)
Persons A and Buses an encryption based system for their conversation. Each conversation message is encoded from the source and decoded in the destination using a shared private positive number key known to each other
Given a number 'x', and a range of 'y' , please find the count of all the numbers in' in that range, such that the product of the number 'n' and 'x' does not contain any digit from the number 'n'. General Constraints: All the inputs will be integers and below 10$ E.g., if x = 2, y = 10 and z = 15, then, 2 × 10 = 20 // Invalid, since the product contains 0 from 10. 2 x 11 = 22 // Valid