Partition Linked List Around Value x Maintaining Original Order

bytedance Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of the two partitions. Write a function that takes the head of the linked list and an integer x as inputs and returns the head of the partitioned linked list. Example Input 1->4->3->2->5->2, 3