Hackerrank – Project Euler+ #008 – Largest product in a series

Hackerrank – Problem description

The problem description – Hackerrank.


I took k following numbers and I calculate a product of these k numbers. Compare the product with actual maximum. Print the maximum if there are no more k following numbers.

I created solution in:

All solutions are also available on my GitHub profile.


Leave a Reply

Your email address will not be published. Required fields are marked *