It was a campus hiring process. First, we had a test on HackerRank with three questions. Those who were able to solve all the questions were shortlisted for interviews.

There were three rounds in the interview. All of them were pretty smooth, and the interviewers and coordinating HRs were extremely helpful and supportive.

First Round:

• Given a source word and a target word, and a dictionary of words all of the same length as the source and target. We have to go from the source word to the target, and we can change just one character in our current word to make a move. Find any sequence of valid moves from source to target.
• Given an extremely large list of numbers, how would you sort it? Obviously, it was not possible to bring the whole list into primary memory and apply sorting on it.

Second Round:

• A standard interval merging-based problem.
• System Design: Design a Chess game application.

Third Round:

• A question focused on the interval working of C language, although it was solvable with basic knowledge of how memory allocation for functions works in C.