Sort 2 Discussions, By:
Please Login in order to post a comment
I find it a bit harsh that my code that solves the original euler problem in python in 5.6 secs only bring me 1.00 point for that challenge.
Shouldn't the Hackerrank version be similar in difficulty to the original problem ?
Without spoiling the challange, could somebody plz answer me how the following criterion is meant:
"Find the sum of the distinct squarefree numbers in the first rows of Pascal's triangle."
The question asks for the sum of distinct squarefree numbers.
Does this mean the sum of all the numbers witch have distinct mod (10E9+7)? I mean in the binomial table with millions of large numbers, I dont see, why two distinct numbers couldnt have the same modulo 10E9+7. How to account for those numbers?
No more comments