Ad
  • Default User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Default User Avatar

    This "rounded up" business is unnecessary and just plain annoying. It's not a real problem to solve but just a hoop to jump through.

  • Default User Avatar

    The description of the valid format is very unspecific and it looks like the last test case is wrong.

  • Default User Avatar

    Works now, thanks

  • Default User Avatar

    Using Haskell I can get the tests running, but when submitting, I'm getting the following error:

     /tmp/haskell115713-20-1se0n8t/Codewars/Exercise/Lucas/Test.hs:26:36:
       Couldn't match expected type `Int' with actual type `Integer' In the first argument of `solution',
       namely `i' In the second argument of `shouldBe', namely `solution i' In the expression: lucasnum i `shouldBe` solution i
    
  • Default User Avatar

    Damn, that it failed the cheating test totally threw me off, I was looking at all the wrong places. Thanks :)

  • Default User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Default User Avatar

    The complicated return type is just tedious and IMHO doesn't add anything to the puzzle. Why not just return a tuple (in Haskell)?

  • Default User Avatar

    Implementing a custom Collector just for fun