Find Middle of the Linked List.Using Two Pointer approach.
Approach - Initialize two pointers, slow and fast, to the head of the linked list.
we will Traverse the linked list using the slow and fast pointers. we will Move the slow pointer one node at a time and the fast pointer two nodes at a time. until th...
dharmblog.hashnode.dev1 min read