Middle of the Linked List - Leetcode #876
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.
problem links: leetcode, geekforgeeks.
Example 1:
Input: head = [1,2,3,4,5]
Output: [3,4,5]
Explanatio...
geekaid.hashnode.dev3 min read