PyVerse is an open-source collection of diverse Python projects, tools, and scripts, ranging from beginner to advanced, across various domains like machine learning, web development, and automation.
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.
Input: head = [1,2,3,4,5]
Output: [3,4,5]
Explanation: The middle node of the list is node 3.
Idea is to use two pointer fast and slow to find the middle node
Have you completed your first issue?
Guidelines
Latest Merged PR Link
https://github.com/UTSAVS26/PyVerse/pull/1079#event-15113087781
Project Description
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. Input: head = [1,2,3,4,5] Output: [3,4,5] Explanation: The middle node of the list is node 3.
Idea is to use two pointer fast and slow to find the middle node
Full Name
Sanat Kumar Gupta
Participant Role
gssoc-ext