The interview was fairly straightforward, conducted through HackerRank. The first section involved a self-introduction, followed by the interviewer asking questions about my ML experience.

Then, there was a coding challenge. The question was fairly simple, involving constructing a tree from a list in level order, then deleting nodes whose values were found in another list, and finally returning the roots of the resultant forest.

Q: Introduce yourself and your background.

Q: Tell me more about your machine learning experience.

Q: The tree construction problem described above.