Q For Problems - Episode 8 - KX Community

Hi everyone,

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

This covers problem 8 from the Project Euler problem set.

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.

Thanks

1 Comment

You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.

Main Office Contacts

Useful Information

Resources