## Hackerrank – Project Euler+ #067 – Maximum path sum II

Hackerrank – Problem description The problem description – Hackerrank. Solution The same solution as Maximum Path Sum I.

## Hackerrank – Project Euler+ #036 – Double-base palindromes

Hackerrank – Problem description The problem description – Hackerrank. Solution Steps are given in the problem description. I created solution in: Java All solutions are also available on my GitHub profile. Java

## Hackerrank – Project Euler+ #022 – Name scores

Hackerrank – Problem description The problem description – Hackerrank. Solution Steps are given in the problem description. I created solution in: Java All solutions are also available on my GitHub profile. Java

## Hackerrank – Project Euler+ #020 – Factorial digit sum

Hackerrank – Problem description The problem description Hackerrank. Solution The catch is to have a support for big numbers operations in your progamming language. Do a factorial and sum the numbers. I created solution in: Ruby All solutions are also available on my GitHub profile. Ruby

## Hackerrank – Project Euler+ #019 – Counting Sundays

Hackerrank – Problem description The problem description – Hackerrank. Solution The implementation is specific based on a programming language – the features in libraries for date manipulation. I found out from given date, what is the next sunday. Then I added 7 days to the sunday’s date, to have next sunday. I was cautioned for […]

## Hackerrank – Project Euler+ #018 – Maximum path sum I

Hackerrank – Problem description The problem description – Hackerrank. Solution I read and store all number into lists by rows. I start from the bottom and take last 2 lines. I sum a number from upper row with numbers from lower row on the left and right side. I do it for every number in […]

## Hackerrank – Project Euler+ #017 – Number to words

Hackerrank – Problem description The problem description – Hackerrank. Solution For detailed informations look at the implementation. I created basic number to word translations. The I find out how many times is a given number present in basic translations. E.g. 12 324 is 12 x 1000, than “twelve thousand”. The rest is without 12 000, […]

## Hackerrank – Project Euler+ #016 – Power digit sum

Hackerrank – Problem description The problem description – Hackerrank. Solution 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+ #015 – Lattice paths

Hackerrank – Problem description The problem description – Hackerrank. Solution The solution is based on this article. I created solution in: Java All solutions are also available on my GitHub profile. Java

## Hackerrank – Project Euler+ #014 – Longest Collatz sequence

Hackerrank – Problem description The problem description – Hackerrank. Solution There are given 2 rules for Collatz sequence: if n is even, then n/2 if n is odd, then 3n + 1 The given problem set of possibilities is to big and it would take too much time. My solution is to precalculate sequence values […]