If we have pointer to head of a linked list, suggest ways to jump to the middle element of the linked list?

Answer 1

With one step(O(1)), we cannot jump to middle of a link list whether its singly or doubly link list.
In my opinion, the best way is :
Traverse linked list using two pointers. Move one pointer by one and other pointer by two. When the fast pointer reaches end slow pointer will reach middle of the linked list.

Lets wait for others to answer, if something we can find better :)

Answer 2

We can traverse the whole linked list and count the no. of nodes. Now traverse the list again till count/2 and return the node at count/2.

Answer 3

count number of element and then divide by two. start the loop from till the getting value and reach on middle