There were 4 rounds.

The first round was a HackerRank test consisting of MCQs and programming questions. The difficulty was moderate.

This was followed by 3 F2F (face-to-face) interview rounds.

In the first F2F round, the interviewer asked core Java questions covering all topics, including exception handling, collections, generics, and Strings. Strong core Java concepts are essential to clear this round. Two coding questions were also given on HackerRank Codepair:

1. Find the second largest number in an array without using any built-in methods, in O(n) time.
2. Print the Fibonacci series up to n, without using recursion.

My second and third F2F rounds were taken together. The interviewer asked me to write 4 programs on Notepad:

1. Find the intersection node of two linked lists.
2. Find all the cousins of a node in a BST.
3. Implement a stack using a queue.
4. Print a number in English words (e.g., 4563 should be printed as "four thousand six hundred three").

1. Find the intersection node of two linked lists.
2. Find all the cousins of a node in a BST.
3. Implement a stack using a queue.
4. Print a number in English words. For example, 4563 should be printed as "four thousand six hundred three."