I applied through college or university. The process took 1 week.

This was an On Campus opportunity. First was the Online Assessment, which consisted of 2 questions, solved both. Then they scheduled two rounds of mandatory interviews, both focusing on:

• DSA
• Problem Solving
• Behavioral Questions
• GenAI Fluency

The first question was standard Longest Common Subsequence; interviewers expected me to first explain the brute force solution and then move on to the optimal approach.

The next question was Merge Two Sorted Linked Lists.

• "Tell me a time when you worked on a problem which was difficult for you."
• "How do you use GenAI in your day to day work?"
• "Tell me about a project where you've used GenAI."

Given an array, you can do a merge operation where you merge (or sum) two adjacent equal numbers, remove both the numbers, and replace with the new merged number. For example, [3 1 1] becomes [3 2]. Now you can operate an infinite number of times, and you need to return the smallest final array after doing all the possible operations optimally, e.g., for [1 1 1 1] the answer will be [4] and not [1 2 1].

The question was Kth Smallest Element in a Sorted Matrix.

• "Explain one project you did at one of your previous internships."
• "Tell me a time when you noticed a critical bug yourself."