Middle of the Linked List (Leetcode 876) || Python || Mohit Bodhija
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.
Middle of the Linked List (Leetcode 876)
Input: head = [1,2,3,4,5]
Output: [3,4,5]
Explanation: The middle node of the list is node 3.