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

Hackerrank – Problem description

The problem description – Hackerrank.

Solution

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:

Java

All solutions are also available on my GitHub profile.

Java

import java.util.Scanner;

public class LargestProduct
{
	public static void main(String[] args)
	{
		Scanner scanner = new Scanner(System.in);
		int tests = scanner.nextInt();
		for (int i = 0; i < tests; i++)
		{
			int n = scanner.nextInt();
			int k = scanner.nextInt();
			String number = scanner.next();
			long max = 0;
			for (int j = 0; j < n - k; j++)
			{
				long product = 1;
				for (int l = j; l < j + k; l++)
				{
					product *= Integer
							.parseInt(String.valueOf(number.charAt(l)));
				}
				if(product > max)
				{
					max = product;
				}
			}
			System.out.println(max);
		}
		scanner.close();
	}
}

import java.util.Scanner;

public class LargestProduct

{

public static void main(String[] args)

{

Scanner scanner = new Scanner(System.in);

int tests = scanner.nextInt();

for (int i = 0; i < tests; i++)

{

int n = scanner.nextInt();

int k = scanner.nextInt();

String number = scanner.next();

long max = 0;

for (int j = 0; j < n - k; j++)

{

long product = 1;

for (int l = j; l < j + k; l++)

{

product *= Integer

.parseInt(String.valueOf(number.charAt(l)));

}

if(product > max)

{

max = product;

}

System.out.println(max);

}

scanner.close();

}

Pavol Pidanič

I can count to 1023 with 10 fingers

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

Hackerrank – Problem description

Solution

Java

Leave a Reply Cancel reply