Partition List

Following are the requirements for the Partition List LeetCode challenge:

“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”.

The URL for the challenge:

Following is a screen capture of the Eclipse IDE using the sample data provided by the challenge:

display <<< list: 1->4->3->2->5->2

display <<< list: 1->2->2->4->3->5 Continue reading “Partition List”