dude gotta say this sol 's fire! Made a version of it just after seeing it, good job!

Agreed, more of a Math problem than a programming problem. The implementation is so easy if you know the aliquot sum and its number theory.

no evidence given, closing

Range applies to the full time span indicated, so if the fastest time was 1:02:03 and the slowest time was 3:05:07 then the time range is 2:03:04.
If the fastest time was 1:30:40 and the slowest time was 2:20:30 then the time range is 0:49:50.

In real world terms the range question is asking "how long did the person at the finish line with the stopwatch have to wait, between the moment the fastest runner finished, and the moment the slowest runner finished? How much time passed between the winner finishing and the last person finishing?"

You have to do time math on the entire period of time, not just the hours/minutes/seconds components separately

fixed. your solution fails both the random and fixed tests consistently now

TypeScript translation

Java translation

O(n) time algorithm does not passing it. I don't know how can I do better. Probably, I should not check non-prime number.

It seems to me that 6 kata is a good place for this task, there is nothing complicated here, and the solution lies on the surface

.

.

duplicate issue.

Java has not description.

That was really hurt me. With Java...

I got same problem. I did use high value and It passed all tests. The description has to fix.