There was a day of online interviews. It consisted of two back-to-back technical interviews, and if you pass both, you have another one with the team lead in the afternoon. The first interview had two LeetCode questions, while the second focused on an object-oriented programming (OOP) question.
Interview questions [1]
Question 1
The first LeetCode question was something like: Given an array and a target number, return the indices of the two numbers in the array that sum up to the target. The solution should have optimal time complexity.
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
