0

Can anyone think of an intelligent way to extract the largest sequence of numbers from a list like:

`[[2, 4, 9], [3, 5, 10], [6], [2, 4, 9], [1, 8, 11], [3, 5, 10], [6], [2, 4, 9], [0, 7], [1, 8, 11]]`

without brute forcing every possibility.

You can only use one number from each nested list and you have to move forward down the main list. ie you could use the '2' from nested list one and the '3' from nested list two. You could use the '6' from nested list 3, but that would limit you to using the '9' from nested list four. So on and so forth.

I've been trying to think of a set of rules that would drastically reduce the number of possibilities that my program would have to check in order to retrieve the longest sequence.