LargAscSub([1, 4, 2, 3, 5, 4, 5, 6, 7, 8, 1, 3, 4, 5, 9, 10, 11])
LargAscSub([1, 2, 3, 11, 12, 13, 14])
LargAscSub([11, 12, 13, 14])
In python, how does one efficiently find the largest consecutive set of numbers in a list that are not necessarily adjacent?