VERRY minor issue, in the java version in this kata, the List class is not imported, and as such gives an error, can be solved by adding:
import java.util.List;

JS fork updating to node 18.

Tests have insufficient coverage. My OCaml (and Scala) solutions will return -1 when the tests expect 0, but these cases are very rarely generated and have no fixed coverage.

Test cases should test the negative population growth so solutions properly handle that, since the instructions also mentions people might leave the town. So the case where it's never reached is a natural extension. Or it should be stated that that cannot happen. But currently it's doing neither.

C fork with changing the signature to have the result string + functions returning nothing + test rewrittal and structurization (it may invalidate 78+ solutions, though...)

(assisted with Katafix)

Tests are sensitive to order of operations on floats despite the truncation.

Results should be returned as floats and compared using an epsilon instead.

JS fork updating to node 18. Please review before approving

Can someone explain to me why the path ["NORTH", "WEST", "SOUTH", "EAST"] is not reducible even though you end up at the same place? That seems to be the point of this kata

In Dart (or at least in the way I coded the solution) the floating point value of some numbers that the tests expect to be round (say 80) is slightly shy of it (say 79.999999999998). When flooring as per instructions, the result becomes 79 instead of the expected 80.

Eventually I figured out what the problem was, and corrected it by simply adding 0.000001 to all my results before flooring them, however I think the test cases should be revised to eliminate this issue, as it adds nothing to the experience (it's not by chance that I found this Kata by picking the first hit when ranking for for "low satisfaction" at 7 kyu).

Also in case somebody is interested: https://en.wikipedia.org/wiki/Potato_paradox

Hi,
Thanks for this challenge. However, I encounter a problem, I pass all the tests except one case where I should have True but I have False. Would these come from my code?

Thanks for your answers :)

Please change the details description so that F(0) = 0, the F(0)=1, F(1)=1 is highly confusing!

Haskell fork

• Test suite updated to use approximate equality instead of exact equality to a truncated result (addressing this issue)
• Console logging removed from random tests

It was enjoyable to create the algorithm and implement the logic. However, formatting the output to match the test's expectations using PowerShell was quite challenging. It would be helpful to explicitly state in the instructions that the expected return type is a string, not an array, key-value pairs, or an object.