R1:4 leetcode type questions - 1 easy 1 not sure 2 mediums
R2: Interview, some coding questions + behavioural, coding was 2 questions, implementing a malloc function + a dynamic programming question (leetcode medium), dont remember what it was exactly
Interview questions [1]
Question 1
So for the programming task dont remember the dynamic programming one exactly, but the other was malloc implementation. Behaviour were basic fit and motivation questions
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
I applied through a recruiter. I interviewed at Microsoft (Tel Aviv-Yafo)
Interview
hr reached to me on linkedIn and sent me Take-home assignment hosted on HackerRank. I had about 10 days to complete. The test included 1 medium/easy question and one hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
Interview questions [1]
Question 1
hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
