The first round was an HR phone screen, which included general questions about interests, projects, and previous experience.

Next, I completed an online HackerRank coding test that featured two questions, including one on string manipulation.

Following the coding test was a 45-minute technical phone interview. During this interview, in response to a question, I mentioned that the answer was an almost complete binary tree. The interviewer stated that such a thing does not exist and that the correct answer is a binary tree. This led to a brief disagreement, and I believe this was the reason I was not selected.

Questions about Merge Sort and Quick Sort.

Data structures like heap and trees.

One simple algorithmic question.