Given an unsorted array of integers, return the length of the longest run of consecutive values (e.g. 1, 2, 3, 4) present anywhere in the array. Your algorithm must run in O(n) time — sorting is the baseline to beat.
Input: one line of space-separated integers (may be empty). Output: the length of the longest consecutive run.
100 4 200 1 3 2
4
The run 1, 2, 3, 4 has length 4.
0 3 7 2 5 8 4 6 0 1
9
Run your code against the sample tests, or Submit to run the full suite.