/*
02 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.
03
04 You should preserve the original relative order of the nodes in each
of the two partitions.
05
06 For example,
07 Given 1->4->3->2->5->2 and x = 3,
08 return 1->2->2->4->3->5.
09 */
typo?
