Find the mid of Linked List Posted on 2018-07-29 | #We use two pointers to find the mid of linked list named as slow = head, fast = head, given head of the linkedList, now conclude the condition of the while loop ceil midfast and fast->next floor midfast->next and fast->next->next