First phase is Codility test (80 mins test with 3 questions) + HR interview (30 mins approx.) .
Second phase, 2 technical interviews (on the same day).
Third phase, HR interview + offer.
Interview questions [1]
Question 1
Given 3 integers representing 3 characters ("A", "B" & "C"), output a string sequence of the characters while preserving the invariant that 2 characters can not appear near to each other in the string.
Output the max length string that preserves this invariant (or empty string in none exist).
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
