Round 1:

Round 1 happened on hackerrank and it composed of 2 programming questions followed by 2 subjective questions where I needed to explain my approach for the coding questions asked and their time and space complexties. It was followed by a 15 minute assesment where behaviour questions were asked.

Question 1: String based question where i had to write a custom sort to sort the list of strings based on a criteria given.

Question 2: Medium level greedy algorithm question.

Round 2:

Round 2 happened with a senior software engineer. Interview started with introductions followed by questions.

Question 1: personal experience where you showed leadership principal deep dive?

Question 2: leetcode problem 249 -> group shifted strings?
Solution : solved using hashmap O(n) time O(N) space.

Question 3: find max and min in every window of size k?
Solution : solved using 2 deques. O(n) time O(k) space.

Round 3:

This happened with a SDE2.

Question 1: find kth largest element in an infinite stream considering every element as last element?

Solution : solved using maintaining a min heap of size k. O(k) space

Question 2: check if a string is present in another string?
Solution : told KMP algorithm and implement it. O(M+N) time.

I was not called for further rounds.

All the best for your interviews!!