This was for a Software Engineer Masters New Graduate position.

There was one round on college campus, in which the interviewer asked in-depth questions based on my resume. A tree traversal coding problem was presented on a whiteboard. I received the result of this round in one week.

After a month, I interviewed onsite at the Seattle campus. There were four rounds, each lasting 50 minutes. Each round included one whiteboard coding question, followed by 5-10 minutes of technical questions and resume discussion. All questions were similar to LeetCode Medium problems related to Strings, Arrays, and Linked Lists.

Resume Behavioral, Situational questions

2D array questions

Deep copy LinkedList with random pointer

LinkedList swap m nodes amongst each k nodes

Number of islands style recursive problem

Inorder successor of binary tree