cancel
Showing results for 
Search instead for 
Did you mean: 
jkane17
Contributor
Contributor

Hi everyone,

Please check out episode 8 of the Q For Problems video series.

This covers problem 8 from the Project Euler problem set.

Project Euler - Problem 8

We want to find the greatest product of thirteen adjacent digits in a given 1000-digit number.

Feel free to share your own solutions and ideas in the comments.

Github Repo

Thanks

1 Comment