Find the length of the shortest transformation to reach a target word.
Given k sorted linked list, merge those list to form a final sorted linked list.