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.
Preguntas de entrevista [1]
Pregunta 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
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.
Preguntas de entrevista [1]
Pregunta 1
1 Greedy + 1 Graph in OT (120 min)
1 Graph (30 min)
1 Tree (30 min)
Me postulé a través de una facultad o universidad. El proceso tomó 1 semana. Acudí a una entrevista en Microsoft (Nueva Delhi)
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
Preguntas de entrevista [1]
Pregunta 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
