easyFast & Slow Pointers Pattern
Middle of the Linked 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:
head = [1,2,3,4,5]Output:
[3,4,5]Explanation: The middle node of the list is node 3.
Hints (0/2)
Try to solve it first! Click "Reveal Next Hint" if you get stuck.
Your Code:
Results:
Output
Click "Run" to execute your code