LeetCode 876: Middle of the Linked List
Problem Restatement We are given the head of a singly linked list. We need to return the middle node of the linked list. If the linked list has two middle nodes, we return the second middle node. For example, in a list with 6 nodes, nodes 3 and 4 are both middle candidates, so we return node 4. LeetCode states this rule explicitly. Input and Output Item Meaning Input head...