Round 1: Online Assessment
Questions:
- Dynamic Programming question (Leetcode medium level)
- Map data structures question (Leetcode medium level)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Technical Interview
Questions:
Question
- Coding question centered around graph data structures (LC medium-hard), specifically targeting the shortest path algorithm.
- Additional constraints included banned nodes and specific nodes for source to destination distance.
- Follow-up questions about dynamic and static memory allocation.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3: Managerial Interview
Questions:
- Casual conversation about online multiplayer games.
- Questions focused on resume, experiences, and skills in React, C++, JavaScript, Socket.io, and other technologies.
- Operating Systems questions about deadlock, virtual memory, and semaphores.
- Questions on the four pillars of Object-Oriented Programming.
Candidate's Approach
No approach provided.
Interviewer's Feedback
The interview concluded on a very positive note.
Round 4: Principal Software Engineering Manager Interview
Questions:
Question
- HR question: "Why do you want to join Microsoft?"
- DSA question based on map and two pointers (LC medium).
- Another DSA question based on tree data structures (LC hard).
Candidate's Approach
Initially, the problem was somewhat unclear, so I asked about constraints and clarified my doubts. I attempted a brute force approach, which did not satisfy the interviewer. After careful consideration, I devised a solution with logarithmic time complexity, which impressed the interviewer.
Interviewer's Feedback
The interviewer was highly impressed with my solution.