Linked List Partition

Given a singly linked list, find a node to partition the linked list into two parts such that the sum of the left sub-linked list equals the sum of the right sub-linked list. If there are multiple partition points, return the partition point node value closest to the head. Example Input [1, 2, 3, 4, 5, 6]