308. Middle of the Linked List
EasyLinked List
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.
Examples
Input: [1,2,3,4,5]
Output: [3,4,5]
Explanation: The middle node is 3.
Constraints
- The number of nodes in the list is in the range [1, 100].
- 1 <= Node.val <= 100
Loading...
Run checks all cases above. Submit evaluates all test cases.