Given the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node.
Find middle of list with 5 nodes
1
→
2
3
4
5
null
Slow moves 1 step, Fast moves 2 steps