← Questions
Sort strings by length, then merge two sorted lists
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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 official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding