MCQs - Aptitude + Quantitative. If we clear this round, then we can go for the coding round. Three questions came in the coding round. It was a good experience, and I gained good knowledge. It's a really good experience.

Given the head node of a singly linked list, return a pointer pointing to the middle of the linked list. If there are an odd number of elements, return the middle element. If there are an even number of elements, return the one which is farther from the head node.

For example, let the linked list be 1->2->3->4->null.