Move the Smallest to the Front
Find the smallest value (if it appears several times, use its first node) and move that node to the front of the list. All the other nodes keep their order. Return the new head. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [4,2,7,2,9]
returns [2,4,7,2,9]
The first 2 moves to the front.
Example 2
head [1,5,3]
returns [1,5,3]
The smallest is already first.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.