My first interview was on my school campus went well and was a mix of behavioral and algorithm.
When I got to Redmond, however, my recruiter was not friendly at all and gave me incorrect information regarding the number of interviews and location.
There were two interviews, both of which were very nice, but a few minutes into the interviews I could tell they didn't have any interest in my thought process, but just wanted me to get to their version of the answer. One question had a DP solution, which I explained in the beginning that's they way I would solve it, which he said was fine. As I was finishing it up, it became apparent that he didn't understand how the DP solution worked and told me I should solve it another way. I had about ten minutes left at that point and didn't end up finishing the question. I asked for feedback at the end and he just wrote out the solution he was looking for on the whiteboard.
Overall, the interviews just asked leetcode questions and wanted the solutions from the website.
I applied through their website with a referral, after a month or so they sent me a home exam, I think about a month after that i had 3 interviews in the same day, each one around 1:15 hours.
Interview questions [1]
Question 1
implement a dictionary where you have set,get and setAll, all in O(1)
The hiring process consists of a HackerRank home exam, followed by three technical interviews covering LeetCode-style problems and system architecture. Once this is done, you will have a final HR interview.
Interview questions [1]
Question 1
I had a technical interview where I was asked to solve the classic 'Climbing Stairs' problem (LeetCode #70), which is a dynamic programming question based on the Fibonacci sequence.
One HR interview, then two problem-solving interviews (beginer level) on HackerRank. You can choose the best programming language for you to use in solving problems. You should think out loud to enable your interviewer to understand how you would think to solve the problem.
Interview questions [1]
Question 1
Find the lowest difference between two numbers in a list