I got into the DSA round for 45 minutes and was joined by a senior developer from the company itself.

I was first asked for a brief introduction, and then I was asked to code on Google Docs on a problem somewhat similar to "Two Sum" on LeetCode.

I started by explaining the brute-force approach and proceeded to provide the optimized solution, and then we were done.

Though the interview lasted for 1 hour, the interviewer was satisfied with my approach and allotted me some extra time.

At last, he asked if I had any questions for them, and I asked how he would rate Java in DSA.

I was called for the HM round, but we were all kept on hold because they did not have vacancies at the time of the interview, and they assured that first priority would be given to us as soon as a vacancy is reported.

A pair of integers in an array that leads to the closest sum to a target value.