It is an on campus interview. The whole process took 1 hour, divided into two 1:1 interviews which has 30 minutes for each. The interviewer first ask some general question about the resume, "introduce your project", "which part is the most challenging", etc., for about 5 to 10 minutes. Then came to the technical question. My first question is select the smallest kth number from a unsorted list. For this one I wrote a quickselect in recursive way. The interviewer seems satisfied with that. But later I came up with the idea of using a min heap (that's after the interview). The second question is searching a particular word in a string, and add "<b>" "<\b>" around the word's every appearance. I thought that would be an easy one so I wrote the code in a short time, but made some mistakes. The interviewer then pointed out several issues in my code, and give me a chance to modify that. Several days later I got the on site invitation.