igorvanloo / project-euler-explained Goto Github PK

Hey! Really liked your solution and thank you for the great explanation, I was having a hard time with this problem.
Anyway, I noticed a (very) small problem on your code for problem 88. It's pretty much meaningless, but you might want to fix it either way.

You'll notice that if you run your code for 2 <= k <= 6, compute(6) will return 18, when it should return 30. The problem is on line 69: array = array[2:limit].
The array is being cut too short and will not include the minimal product-sum for k = 6. If we print the array on line 69, we have [4, 6, 8, 8].
Changing the line to array = array[2:limit + 1]: [4, 6, 8, 8, 12].

I wonder if it's not a problem for any k > 6. It sure isn't for 12000.
Again thanks for your solution and explanation.