A question that required knowledge of BFS/DFS algorithms. Given a matrix of numbers, change all numbers - let's say equal to 1 (while the rest are zero), that can be reached from the starting point, and are adjacent to one another in the matrix (resulting in a "coloring" pattern).
why you want to work at microsft?
What courses I have completed (they specifically asks for Data Structure, Algorithms, intro to computer science and another one that I don't remember), I had to describe how I work in a group project and to describe briefly about a coding project I have done Whether it was as part of studies or the hackton, etc.
In the first interview, I was asked among other things, to described the concept of threads to a 6 year old. One of the technical questions later on was the "number of islands" problem, which you can find on leet code.
What technologies are you familiar with?
1. list comprehension question, was asked about the difference between regular copy and deep copy 2. write function to determine of 2 string are palindrome of each other also in the introduction part he ask why more sever are better for storage then one large storage(Because of parallel writing to storage)
Why are you studying your certain degree? What is something that you've done in your own time relating to the degree?
some raid XOR question that i dont remember
Tell us about your favorite project.
1. Detect and remove loop in a linked list 2. reverse linked list.
Viewing 1471 - 1480 interview questions