Republished with corrected fixed tests. Random tests under construction constructionered.
The particular offending test has been changed to preserve solutions that special-cased it. Solutions that return AMBIGUOUS results instead of IMPOSSIBLE, according to the previous conditions, will be invalidated though. Their logic is no longer correct. The example solution has been replaced - its logic was also incorrect. Sorry, @efess. (Sometimes I am a bit lazy.)
done
Python translation
If you make a fork which rewrites the description I will happily review it :)
A Python translation might also bring some extra attention
An extremely interessant and concrete Kata BUT ... the presentation and the task description is not very appealing...
I wonder if a mod can do something because it deserves better than 61 completions after 6 years!
Found this so hard to get my head round. Feels like it should be easy to reason about the recursion, but for me, it wasn't!
I enjoyed the challenge though!
Thanks :]
Approved ;-)
Haskell translation available for approval. (Can't approve it myself.)
Haskell translation published. Someone please approve. (I can't do it myself.)
Yep, should be solved now. Random tests have been added. If you can think of edge cases that aren't tested yet, yell.
Is this solved?
Thanks for this suggestion. I have made a mention in the description.
Republished with corrected fixed tests. Random tests
under constructionconstructionered.The particular offending test has been changed to preserve solutions that special-cased it. Solutions that return
AMBIGUOUS
results instead ofIMPOSSIBLE
, according to the previous conditions, will be invalidated though. Their logic is no longer correct. The example solution has been replaced - its logic was also incorrect. Sorry,@efess
. (Sometimes I am a bit lazy.)Very cool thank you :)
Loading more items...