Finding Middle Element of LinkedList | DSA | JAVA | LEETCODE | GEEKSFORGEEKS

preview_player
Показать описание
Hy this video will contains the solution of an easy leetcode problem named-"
Middle of the Linked List"

Problem -
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: head = [1,2,3,4,5]
Output: [3]
Explanation: The middle node of the list is node 3.

Keep supporting:
#algorithm #datastructure #coding
Рекомендации по теме
Комментарии
Автор

Thanks bhaiya, It helped me a lot to understand the basic concept.

ajaykumar