Regarding finding the middle element of linked list

Question

I am following the below approach to calculate the middle element from the linked list , but I want is there any built in method or any other approach which can als

Answer 1

Options:

• Have a double linked-list and go from the back and front at the same time until you get to a common point.
• Store the size of the list and simply stop when you've reached this half this size (similar to what the standard API's LinkedList does).

Other than that I don't think you can do better than your algorithm.