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
Even Round 2 Interview Experience (SWE Intern - Jul to Dec '25)
Summary
I experienced Even's Round 2 technical interview, which focused on a series of tree-based distance and latency problems, gradually leading to a well-known LeetCode hard problem.
Full Experience
🧪 Even Round 2 Interview – Tree Distance and Latency Questions
In Even Round 2 technical interview, I was asked a series of tree-based distance and latency problems that built upon each other. The questions started with a basic BFS and gradually led to a well-known LeetCode hard problem.
Given:
A tree with n nodes labeled from 0 to n-1 and an undirected list of edges, with unit distance between each node:
Example:
n = 6
edges = [[0,1], [0,2], [2,3], [2,4], [2,5]]
Interview Questions (3)
Define latency as the sum of distances from a node to all others. Find the latency from the given src node.
Compute the latency for any node input.
Preparation Tips
💬 Interview Tip
These questions test your ability to:
- Traverse trees (BFS/DFS)
- Accumulate values across traversals
- Optimize naive solutions using recursive insights
Be prepared to build on each solution — the interviewer will often move from BFS → brute-force → optimized tree DP.