Sort strings by length, then merge two sorted lists
Given two unsorted lists of strings, sort them by string length. Follow-up: if both lists already arrive sorted by length, merge them into one sorted list in linear time.
No answer yet. Write the first one; the best answer gets endorsed.
