Ad
  • Custom User Avatar

    When you run tests (not submit) then you will get "sumPrimes is not in the scope". This is what i see: "do sumPrimes input1 shouldBe expected1"

    Moreover, can you give a little hint? My solution is timing out on calculating "3000000th" prime: it is: 49979687. How advanced algorithm is sufficient to make it in the time?

  • Custom User Avatar

    Task needs to tell what diagnosis should be shown for what values. It's pretty not obvious that we should display "Fat" instead of "Overweight"

  • Custom User Avatar

    Tests are expecting sumPrimes function, but final checker expects sumOfAnsweredQueries function.
    Second, what does this guarantee mean? "1 <= x <= min(250000, length P)"
    Third, is it really that hard to solve this problem? Calculating primes up to 49979687 (this is last prime required by the task - 3000000th) is taking waaay to long...
    At first i way happy to see some algorithmic task in here, but now i feel it's very restrictive or i don't understand something.

  • Custom User Avatar

    Test cases doesn't check if name of the fruit after "rotten" is uppercase, e.g rottenBanana is treated the same as rottenbanana

  • Custom User Avatar

    Really fun kata, can be used as some kind of introduction to Singletons in haskell :)

  • Custom User Avatar

    Description is wrong.
    We have to output "f(x) = " for a = 0, b = 0 instead of "f(x) = 0", anyway when a=0 then it is not a linear function...
    Moreover we need to output "f(x) = -1x" for a = -1 and b = 0. I think test cases need reconstruction...