The internship process consisted of two rounds:

1. Online Assessment: There were two questions, both of easy-medium difficulty. Both questions were based on prime numbers. The first question was easily solved using a sieve, and the second was based on GCD and coprime numbers. I completed the first question and passed about 70 percent of the test cases in the second due to time constraints. About 12 students were shortlisted for the interview round.

The interview lasted about 30 minutes and began with introductions from both the interviewer and myself. The interviewer then immediately presented Data Structures and Algorithms (DSA) problems, sharing a Google Doc. I was only required to discuss my approach and provide pseudocode, not write complete code.

The first question involved using a random function, which I managed to solve after some discussion and a hint. The second question was simpler; the interviewer asked which data structure I would use. It was a straightforward priority queue question. Upon my suggestion of using a min-heap, he began asking about the internal structure of a min-heap.