fast-slow-pointersmiddle-of-the-linked-list
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.
Example 1
Input: values = [1,2,3,4,5] Output: 3
Example 2
Input: values = [1,2,3,4,5,6] Output: 4
Constraints
- The number of nodes in the list is in the range
[1, 100]. 1 <= Node.val <= 100
Loading workspace editor...
Ready to run
Input:
{
"values": [
1,
2,
3,
4,
5
]
}Expected Output:
3