Middle of the Linked List
Easy
Linked List
•
Grind 75
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.

Constraints:

  • The number of nodes in the list is in the range [1, 100]
  • 1 <= Node.val <= 100