Initialize two dummy nodes to serve as the heads of the two partitions (less than x and greater than or equal to x).

Traverse the original linked list, appending each node to the appropriate partition list based on its value compared to x, while maintaining the original order within each partition.

After traversal, connect the tail of the "less than x" partition to the head of the "greater than or equal to x" partition, then set the next pointer of the latter partition's tail to null to terminate the combined list.