Microsoft L60 Interview Experience

OA: Complex Greedy Question & simple DFS with Bit Manipulation

Interview 1: Project Discussion & Variation of Leaf Similar Trees (expected solution with a single DFS call)

Interview 2:

• A long problem description (like that on CodeForces or CodeChef) but boiled down to a simple DFS with edge case handling
• Detecting start of a cycle in a Linked List (with mathematical derivation of the solution and why slow & fast pointers would work)

Interview 3: Behavioral Questions, Project Discussion & Peeking Iterator (Discussion on Pros & Cons of Eager and Lazy Evaluation)

*HM Round was scheduled, but the recruiter mentioned that someone else was already hired, so they would not be proceeding with the candidature but might reach out in the future.