Written test followed by 3 rounds.

Mostly, there were problem-solving questions and questions depending on your resume. I recall the following questions:

1. Given a linked list containing 0s and 1s, rearrange it so that all 0s come before 1s. (O(n))

2. Given a binary tree, find the maximum diameter and the two end nodes of it.

3. Delete the kth node from the end of a linked list (single pass).

There were some more that I don't recall.

I work in NLP and ML, so they asked a lot of questions regarding my projects and internships. Therefore, prepare your resume well.