We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
A little late but I guess still a follow up comment will be helpful. You are absolutely correct, so for fastest sort here everything needs to stay as string. With that said, one can sort elements (as strings) by the legth first. Then taking same length sub-lists and sorting them (still elements are strings!) will give you the fast enough code for full credit here.
Big Sorting
You are viewing a single comment's thread. Return to all comments →
A little late but I guess still a follow up comment will be helpful. You are absolutely correct, so for fastest sort here everything needs to stay as string. With that said, one can sort elements (as strings) by the legth first. Then taking same length sub-lists and sorting them (still elements are strings!) will give you the fast enough code for full credit here.