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.
You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.
Tel: +44 (0)28 3025 2242
Tel: +1 (212) 447 6700
Tel: +61 (0)2 9236 5700
KX. All Rights Reserved.
KX and kdb+ are registered trademarks of KX Systems, Inc., a subsidiary of FD Technologies plc.