I had the same problem for a while. I just came back to the problem and solved it and naturally now I'm having trouble reproducing the rounding errors. Can you show how you are attempting to solve the kata and I'll see if I can spot what's going on?
I'm interested in this O(f()^2 * logf()) approach that you mentioned. I'd like to learn this optimization. Could you point me to any online reference?
EDIT: I found your submission. Is this a popular approach? I can't find similar applications online. Would appreciate some references.
I just can't figure out where I'm making a rounding error with test4. At my wit's end here, would appreciate some direction.
This comment is hidden because it contains spoiler information about the solution
Slower, but more concise solution compared to first. Leverages Java 8 streams and Functional Interfaces.
got -1 in C#, too
Ah! What a careless oversight. Granted, I am not familiar with zipcodes. Thanks for pointing that out.
Got here again "by chance" (or not)... And I'm one more time perfectly AMAZED to see people downvoting what is actually a constructive comment that is telling something about the problem without throwing the solution...
I love people more and more... ;p
got -1 in python
unfortunately, no (about a page). But you do not need to edit your message. There is a "spoiler" info hidden on the right of the "reply/edit/collapse" buttons of each message. When your mouse moves over a message, if you see "spoiler" in red, the message is already flagged. If it's blue, you can flag it (if needed!).
Note: depending on your honor points, you may or not flag messages of other persons. In any case, you can at least flag your own messages.
EDIT: about edition: rules are not se same everywhere if I remember well. Sometimes you cannot edit anymore your messages if somebody already wrote an answer. Sometimes... :/
I see, sorry about that. I'm new around here. Is there a rules/etiquette page you could forward me to? It doesn't seem like I can edit it either.