In the splitInHalf method, we are using 2 pointer technique to find the mid node of the list.
But in this case why are we not starting slow and fast both with head. Instead why are we starting it with head.next. ?
Course: Educative: Interactive Courses for Software Developers
Lesson: Educative: Interactive Courses for Software Developers