It was an on-campus interview. The whole process took one hour, divided into two one-on-one interviews, each lasting 30 minutes.

The interviewer first asked some general questions about my resume, such as "Introduce your project" and "Which part was the most challenging?", for about five to ten minutes.

Then, the technical questions began.

My first question was to select the kth smallest number from an unsorted list. For this, I wrote a recursive Quickselect algorithm. The interviewer seemed satisfied with that. Later, after the interview, I thought of an alternative approach using a min-heap.

The second question was to search for a particular word in a string and add "" and "" around every appearance of the word. I thought this would be an easy one and wrote the code quickly, but I made some mistakes. The interviewer pointed out several issues in my code and gave me a chance to modify it.

Several days later, I received the on-site invitation.

Regarding the question of searching for a particular word and inserting a <b> tag around it, I didn't pay much attention to the word "word" at first. So, if I searched for "all" within the string "install", my code would return something like "install". The interviewer pointed out this issue, and then I added something like searching for a separator first and then comparing the word.