Partition Linked List Around Pivot X

Given the head of 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. ### Constraints - The number of nodes in the list is in the range `[0, 200]`. - `-100 <= Node.val <= 100` - `-200 <= x <= 200` ### Input Format First line contains the pivot integer `x`. Second line contains space-separated integers representing the list. ### Output Format Print the space-separated integers of the partitioned list.