Three rounds were conducted:

1. HackerRank Test: I passed this exam. It presented tricky problems, and we had to write code in Java.

2. CoderPad Test: This was conducted by someone from GS. They presented a problem and asked for a solution. The test was polite, and the person conducting it was well-experienced. They asked tricky problems along with questions about Time and Space complexity for the same.

3. F2F Interview: They initially scheduled this in Mumbai but changed it to Bengaluru two days prior. This was conducted by two people. They asked questions regarding linked lists, hash maps, singly linked lists, tree maps, and binary search trees. They also asked to write pseudocode for BST insertion (recursive and iterative).

The funny thing was that one of the interviewers appeared to be a fresher, which was easily predictable from their behavior.

The discussion went well, and even after the interview went well, they rejected me.

They were laughing while conducting the interview, looking at each other, and would stand up to see the code – displaying immature behaviors.

These interviewers were not prepared. They kept looking at their mobile phones and asked random questions found on Google.

Find whether the given number is a power of 10 or not.

Find pairs such that their sum will be equal to X.

Find the cycle in a linked list. Linked list working. How HashMap and TreeMap work. Pseudocode to insert an element into a Binary Search Tree (iterative & recursive).