initial phone screen with recruiter
Online assessment - leetcode type (data structure algorithmic) questions
merging intervals + finding n closest points to center of graph
medium + hard level, optimal solution involved using heap data structure
Exam , coding ,interviews three rounds was there. Many questions related to experience and how I handled difficult situations were there like the challenges I faced and things like that