I applied online. The process took 1 day. I interviewed at Microsoft in Jan 2008
Interview
Asked Questions:
Maximum running sum, for example for an array N1...Nk, find out the range results in max sum.
1. Dining philosophers problem (see wiki)
In computer science, the dining philosophers problem is an illustrative example of a common computing problem in concurrency. It is a classic multi-process synchronization problem.
In 1965, Edsger Dijkstra set an examination question on a synchronization problem where five computers competed for access to five shared tape drive peripherals. Soon afterwards the problem was retold by Tony Hoare as the dining philosophers problem.
This is a theoretical explanation of deadlock and resource starvation by assuming that each philosopher takes a different fork as a first priority and then looks for another.
2. Maximum common Subsequence
I answered using dynamic programming
3. And some brain teasers.
Expect technical deep dives, coding challenges, and problem-solving scenarios. Questions will probe your knowledge of data structures, algorithms, and software design, assessing your ability to build robust systems. yes yus yes
I applied online. I interviewed at Microsoft in Jan 2024
Interview
Technical 3 round interview questions
Mangerial 1 round interview questions
Hr 1 round questions
But complex questions
All the best all the best best best very good option and good benefits
Interview questions [1]
Question 1
Situational questions like reasoning for the approach
Nice and smooth the interviewer were really very helpful and knowledgeable also they try to help while giving interview and also when I have the interview they acknowledged if I was saying right or wrong so overall nice experience
Interview questions [1]
Question 1
2 coding rounds one on implementation and another on dsa
