Middle of the Linked List

Easy

Given the head of a singly linked list, return the list starting from the middle node. If there are two middle nodes, return the second one.

Example 1

Input:  head = [1,2,3,4,5]
Output: [3,4,5]

Example 2

Input:  head = [1,2,3,4,5,6]
Output: [4,5,6]

Constraints

• 1 <= number of nodes <= 100
• 1 <= Node.val <= 100