CV screening, algorithm test with 4 tasks and then 3x 1 hour interviews with algorithm tasks. I solved all 3 (2 of them quite a bit before the time ran out), the 3rd one was kind of weird with the senior software engineer forcing me to continue with my bad solution even though i said i want to change my idea. Did not get accepted and didn't get any feedback about it which i didn't like at all.
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.
I interviewed at Microsoft (Cairo, Cairo Governorate)
Interview
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
