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
Glean | Phone Screen | Dec 2024 | Reject
Summary
I had a phone screen with Glean where I was asked three interconnected matrix-based problems involving pathfinding from a desk to a snack while avoiding bosses and considering a 'noise' factor, which ultimately led to a rejection.
Full Experience
You are given a matrix where each cell can have values
D - your desk B - Boss's desk (can be multiple) S - Snack (can be multiple) . - empty
- wall
first question -> Find if it's possible to get a snack from your desk without disturbing any boss. BFS
second question -> If the snack has a noise value K. K represnt the number of empty spaces the noise can travel through. find if its' possible to get the snack without disturbing any boss' through noise.
sol. first do multisource bfs from All B's and store min distance of a cell from any B's. then do a BFS from D to S such that you do not use any points where dist(cell) <= k from B
third question ->
Find the maximum value of K for which you can get the snack without distrubing any B's.
Binary Search on K with the solution of 2nd.
Interview Questions (3)
You are given a matrix where each cell can have values: D - your desk, B - Boss's desk (can be multiple), S - Snack (can be multiple), . - empty, # - wall. Find if it's possible to get a snack from your desk without disturbing any boss.
If the snack has a noise value K, which represents the number of empty spaces the noise can travel through, find if it's possible to get the snack without disturbing any boss' through noise.
Find the maximum value of K for which you can get the snack without disturbing any B's.