Referred through a friend, my resume was shortlisted, and two coding rounds were scheduled by HR.

HR mentioned that a third round would only be scheduled if she received two positive outcomes. The first round went smoothly, and I received positive feedback. For the second round, I was able to identify the concept and algorithm of the question quickly. Unfortunately, not all test cases passed for me. They placed me on hold for some time and finally revealed that they had hired someone else.

1. Reverse the linked list in pairs. Implement the Linked List data structure yourself, and then solve it in more than one way.

For example, if the given linked list is 1->2->3->4->5->6->7->8, then you should return the linked list as: 2->1->4->3->6->5->8->7.

Also, no extra memory should be used to implement the solution.

1. A question with an enhanced binary search concept, asked on the HackerRank platform.