Middle of the Linked List

Find the middle node of a linked list and print the list from that node to the end. If there are two middle nodes (even length), use the second one.

List format. A linked list is given as two lines: its length n, then its n values from head to tail (the second line is empty when n = 0). When you print a list, print its values on one line separated by spaces, or the word empty if it has no nodes.

Input: one list (n ≥ 1).

Output: the values from the middle node to the tail.

Constraints: 1 ≤ n ≤ 10⁵.

Think about it: the slow and fast pointer trick — move slow one step and fast two steps; when fast reaches the end, slow is in the middle. One pass, no counting.