Is there any place you can reference that unrolls this lazyness for us? I find it hard to tell that it's using laziness.

So I created a solution that runs a diff function over the entire list and then returns the minimum diff. This resulted in a timeout error, their lists are too long. Then I decided to sort the list first by length similarity and return early when the length's start to become too different. Still no luck. Not sure I understand the "best" code snippets on the leaderboards for haskell, how do you do this without running diff on the entire list?

Haskell's pageIndex function is really screwy