Fiz uma entrevista na empresa Microsoft (Hyderābād).
Entrevista
2 rounds. First round of DSA + OS, 2nd round on partly HR, OOPS and DSA concepts. Coding question only in 1st round. Array based, locks in OS, virtual functions based questions.
Perguntas de entrevista [1]
Pergunta 1
1. Mutex locks discussion in OS
2. Virtual Functions in C++
3. Project discussion
4. Question on sorted array.
The process had three rounds: an online assessment following resume shortlisting, and two interviews focused on Data Structures and Algorithms, testing both problem solving skills and coding efficiency. Also projects in resume were asked.
Perguntas de entrevista [1]
Pergunta 1
They asked me to solve a DSA problem on arrays, focusing on both the brute force and optimized approach, and explain the trade offs between time and space complexity
Fiz uma entrevista na empresa Microsoft (Bengaluru).
Entrevista
Online test with 2 LC Medium-Hard level.
1 Greedy + 1 Graph
Interview 2 LC Medium level.
1 Graph + 1 Tree
Finally, HR Round based on resume, primarily ask about projects and experienced technologies.
Perguntas de entrevista [1]
Pergunta 1
1 Greedy + 1 Graph in OT (120 min)
1 Graph (30 min)
1 Tree (30 min)
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 semana. Fiz uma entrevista na empresa Microsoft (Nova Deli).
Entrevista
Online interview assessment with three hard level DSA questions, primarily based on resume achievements, including two data structure and algorithm problems focused on arrays and strings, plus achievement driven discussion
Perguntas de entrevista [1]
Pergunta 1
One of the DSA questions they asked was: Reverse a singly linked list without using extra space, and explain both iterative and recursive approaches with time and space complexities