Find the middle element of linked list in one Pass.
You can use the runner technique.
Two pointers can be used and both will be running at separate speeds. One runner pointer can go in two steps at a time and other pointer can go in one step at a time. Second one will always cover half the distance as that of the other. When one reaches the end, other will be be middle.
Comment about your approach or share the github url for your solution.