Tootfinder

@rustaceans@mastodon.social Here's my take on the challenge from issue 62!
@… Didn't benchmark or anything, but the algo only goes over the list once to sort it (worst case `O(n * log(n))`) and then once to merge the ranges (`O(n)`).
Run on the playground: #RustLang #rust #algorithm #RustBytes