Finding middle node in a Linked List in O(N) time and Single Pass (with CODE illustration)

This video shows both the Naive and Efficient algorithm to find middle node in a linked list. It covers O(N) time complexity and a single pass algorithm. This video also shows the Code Demo of the program.
If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[saikumarbandapalli]

we are already checking "fptr->next" is NULL or not in the while loop condition. I think "if(fptr)" condition in the while loop is not required. fptr=fptr->next->next will works fine.

[nishayadav]

thanks a lot sir . this video is very helpful

[ArtiKumari-sulk]

Explanation is very nice. But, This playlist has many repetitive videos after 103. It will be great if you could remove the repetivitve videos from playlist for better user experience.