Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Microsoft (Bengaluru) em set. de 2020
Entrevista
I sat for on-campus internship for SDE role at Microsoft.
The Preliminary Round consisted of a online coding test which had 3 questions to be solved in 90 minutes. They were pretty easy (kadane's algorithm, easy-medium leetcode.).
I was selected for 1:1 interviews. Round 1 was just to check whether the candidate can code and explain the time complexity and be able optimize the code. I was given a easy problem on string manipulation.
Round 2 was when things got serious. I was questioned on my resume, previous internships, projects for about 20-25 minutes. After that I was given a grid path finding algorithm(application of BFS, DFS). There were a few extra conditions and also required to print the path etc. I wrote a BFS approach, the interviewer asked for some runs on hypothetical data. I was also asked time complexities of BFS and DFS approaches and if one of them was better than the other. The Interviewer seemed satisfied.
I was offered the SDE Intern role some hours later (yeah, just 2 rounds).
Perguntas de entrevista [1]
Pergunta 1
Given an n*m grid, you enter the grid at some cell in the first row and leave the grid at some cell in the nth(last) row. Every cell has four directional parameter, indicating whether the cell in that direction can be visited. Print the Shortest possible path.
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