Middle of the Linked List

You are 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.

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 <= The length of the list <= 100
• 1 <= Node.val <= 100

Company Tags

Please upgrade to NeetCode Pro to view company tags.