I got a referral from a connection on LinkedIn and after submitting the resume on their portal, got the test link very next day.

Round 1(Online Assessment): 14 question -> 13/9/21
2 SQL, 10 Mcq, 2 Coding question based on heap and graph (leetcode medium)

Round 2(Technical) -> 23/9/21
First Question: Given a string of travel direction (Up, Down, Left & Right) have to tell whether i am getting at some previous traveled cordinates.
Second Question : DFS in n-aray tree
Solved both

Round 3(Technical) -> 1/10/21
First question: Clone Graph
Next question: LLD Design an account system of bank

Round 4 (Hiring manager round) ->14/10/21
Some basic behavioral questions and then moved on to a coding question
Question: Given a row-column wise sorted matrix. Find an element. Applied binary search on rows and column. Then he changed problem statement to now sorting continuity is not ensured between last row highest value and this row smallest value. Gave a N+M solution. Then asked me to replace the value with INT_MAX and maintain the row-column sort property. Gave a solution but he was not impressed with it. Interviewer ended the interview 15 minutes before. Got a rejection mail 3 minutes later.