Online Assessment : 2 Medium level question based on priorityQueue and HashMap. Don't remember them clearly but not so difficult.

Round 1 - Brief Introduction followed by questions on previous company projects.
First Coding question asked: Find number x in a sorted distinct array such that arr[x] = x. Gave brute force approach and then binary search approach. Took me sometime to exactly explain the second approach as I missed out the "distinct" part from the question and kept on thinking of solution where array could have repeatition.

Second Coding Question: After completing the first question quickly on code pad, I was given second question:
https://leetcode.com/problems/merge-k-sorted-lists/
Gave the initial approach where all the list nodes will be pushed in the priorityQueue and then create a merge list out of it. After some initial thinking, optmized it further. However, I couldn't complete the code fully as I took some time during my first coding question.

This round didn't go well as I couldn't hold onto my nerves.

Round 2: Introduction + behavioral questions(too many)
First Coding Question: https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/ with a little tweak. Gave the optimized solution in first go and coded quickly.

Second Coding Question: https://leetcode.com/problems/meeting-rooms-ii/ Difference in terms of input given.
Gave the optimized solution in first go and coded quickly.

This round went really well.

Round 3: Introduction + behavioral questions(again too many)
First Coding Question : Standard BFS problem. Approach and code part went smoothly.
Second Coding Quetsion : https://leetcode.com/problems/maximum-subarray/ with few added conditions. Here also, Approach and code part went smoothly.

Round 4: Introduction + project questions(too many) + behavioral questions(again too many)
Question related to low level design and high level design (Approx. 20-25 minutes).

Verdict: Selected

Big Thanks to leetcode community for this.