Hackerrank - Project Euler+ #013 - Large sum

Hackerrank - Problem description The problem description - Hackerrank. Solution We need to sum all given numbers. The catch is to use a feature of chosen programming language, which allows us operation with big numbers (e. g. BigInteger in Java) I created solution in: Java All solutions are also available on my GitHub profile. Java […]

Hackerrank - Project Euler+ #011 - Largest product in a grid

Hackerrank - Problem description The problem description - Hackerrank. Solution We have to calculate products of number foursomes for all directions in a grid and take the greatest product value. I created solution in: Java All solutions are also available on my GitHub profile. Java

Hackerrank - Project Euler+ #010 - Summation of primes

Hackerrank - Problem description The problem description - Hackerrank. Solution First, I created a list of all prime numbers from 2 to 106 (upper constraint). I used Sieve of Eratosthenes algorithm. Then, I sum each element from a subset of prime numbers gained from test case. I created solution in: Java All solutions are also […]

Hackerrank - Project Euler+ #009 - Special Pythagorean triplet

Hackerrank - Problem description The problem description - Hackerrank. Solution I found the solution on StackOverflow. One could use the Wikipedia as a source. I created solution in: Java All solutions are also available on my GitHub profile. Java

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. […]

Hackerrank - Project Euler+ #007 - 10001st prime

Hackerrank - Problem description The problem description - Hackerrank. Solution The challenge has upper constraint that we could have at most 10 001 prime numbers from the smallest (2). I found out that the upper bound is the number 104 743. There exist first 10 001 prime numbers. We calculate list all of them and […]

Hackerrank - Project Euler+ #006 - Sum square difference

Hackerrank - Problem description The problem description - Hackerrank. Solution We calculate 3 equations for every number from 1 to N. Sum of squares: Square of sum: Result - Difference between sums: I created solution in: Java All solutions are also available on my GitHub profile. Java

Hackerrank - Project Euler+ #005 - Smallest multiple

Hackerrank - Problem description The problem description - Hackerrank. Solution We need to make a prime factorization of number (problem constraints), because some of the numbers are divisors of the other numbers. We reduce unnecessary multiplications and divisions. We could use Sieve of Eratosthenes to calculate all prime numbers from 2 to N. Let's calculate […]

Hackerrank - Project Euler+ #004 - Largest palindrome product

Hackerrank - Problem description The problem description - Hackerrank. Solution We need to find out if the product of two 3-figured number is a palindrome and it is smaller than exercise upper constraint. My solution starts with initializing two numbers as 999. I continually decremented second number by 1, until it is equal to 100. […]