Partition a linked list to three equal parts with one pass and constant space complexity.
Sigiloso
need to use three pointer. Traverse the list with updating three pointer using following technique: fast=fast.next.next.next mid=mid.next.next slow=slow.next