Midpoint of a List

Easy · Midpoint of a List

You get a non-empty singly linked list whose first node is `start`. Return the node that sits exactly in the middle. If the list has an even number of nodes, there are two middle nodes; return the second one (the one closer to the end). You return the node itself, so the whole tail starting from it is what gets checked.…