Me postulé en línea. El proceso tomó 1 día. Acudí a una entrevista en Microsoft (Chennai) en sep 2015
Entrevista
Written Test and Technical interview. They conducted written test in HackerRank and an hour duration. Interviewers are very friendly and given hints to me while solving problems. Written Test and Technical interview. They conducted written test in HackerRank and an hour duration. Interviewers are very friendly and given hints to me while solving problems.
Preguntas de entrevista [1]
Pregunta 1
Written test:
They conducted written test in HackerRank and an hour duration. They asked me to implement the functions for the following two problems.
1) Maximum product Sum of an Array.
http://www.geeksforgeeks.org/maximum-product-subarray/
2) Building bridges problem.
http://www.geeksforgeeks.org/dynamic-programming-set-14-variations-of-lis/
Technical Interview 1:
He is very friendly and given hints to me while solving problems.
1) First he asked me about an overview of my current project then most challenging thing faced in the project. After my response, he asked me what you learnt from that challenging thing.
2) Given an array of integers of the size of n, it contains zeros in random positions, we need to move all zeros to end of the array in a single scan without extra space.
http://www.geeksforgeeks.org/move-zeroes-end-array/
3) Merging point of two linked lists.
http://www.geeksforgeeks.org/merge-two-sorted-linked-lists/
4) questions related to programming languages
a) about inheritance
b) about classes and interfaces
c) abstract classes and virtual functions, ...
5) He given a situation and asked me to design required classes and functions which are useful to program that situation.
6) The last question is given a number we need to find the next nearest number in 2^n.
input: 127 output: 128
input: 129 output: 256
Technical Interview 2:
He asked me very simple questions, but he wants to cover each and every corner case.
1) Reverse group of elements in a linked list
http://www.geeksforgeeks.org/reverse-a-list-in-groups-of-given-size/
2) perform push,pop and min operations of stack in O(1) time.
http://www.geeksforgeeks.org/design-and-implement-special-stack-data-structure/
The interview was a long process. There was first the recruiter screen, which was followed by a 4-loop interview structure that covered technical, behavioral, and system design. The interviewers were very kind and accommodating.
Me postulé en línea. El proceso tomó 3 semanas. Acudí a una entrevista en Microsoft
Entrevista
After my application to ClipChamp - Microsoft, a recruiter reached out and scheduled my first interview. It was about basic interview questions and background analysis. After that I had my technical interview. The recruiter specifically said that I would be facing medium hacker rank questions. So I prepared accordingly. However, what I actually got was to analyse an application and re work it according to new requirements. I felt like I was set up for failure on purpose. Didn’t even hear back after that interview.
Took a bit longer than I thought, spanning about three weeks from start to finish. After a quick recruiter screen, I had a technical round where I was asked about validating a binary search tree. The wild part is, I had literally seen this exact problem on prachub.com while prepping. It helped me feel more confident discussing my approach and edge cases. There was also a behavioral interview where I shared my experiences, and eventually, I received an offer. I chose to decline it, though, as it wasn't the right fit for me at the time.