sauravhathi / find-middle-of-the-linked-list Goto Github PK

Given a linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list is 1->2->3->4->5->6 then the output should be 4.

Home Page: https://sauravhathi.github.io/find-middle-of-the-linked-list

License: MIT License