Ad
  • Custom User Avatar

    Agree on 3ky, quite easy. I'll get to choppa, thanx :)

  • Custom User Avatar

    Not an issue

  • Default User Avatar

    This kata is basically a substantially restricted version of "Get to the Choppa" which is also 3 kyu. The later kata uses squares up to 200x200 which makes optomization part of the challenge. Perhaps this kata should be 4 kyu? That would allow people to solve this first in preparation for "Get to the Choppa". I guess they can do that anyway though. Maybe I'm missing something, but this seems like a significantly easier problem.

  • Default User Avatar

    Figured out my issue. I didn't imagine that test #6 would take so much longer than test #5. My code was simply not fast enough for the 200x200 grid case. After playing around with it, I got it to fail on the 6th case and found out that it had been passing the 5th since editing it. It just happened to have a weird bug originally that triggered on the 5th test but not the 4th.

  • Default User Avatar

    I have sort of solved this kata. My code runs fine for the first 4 examples, however on the 5th it does one of several thigns depending on what I change (the other test cases run fine with changes):

    1. It hangs if I leave it as it was originally written.
    2. If I itentionally break it early it stops with a nearly completed path which I then manually complete in the code to see what is going on.

    If I do number 2 I get the error

    Traceback:
    in
    AttributeError: 'list' object has no attribute 'passable'

    Which I assume is because I'm adding (20, 11) which is a list of numbers to a list of nodes. When I do the same thing but add a node object to the end of the list I get the same error about 8000ms time out. Should I assume my code runs correctly but just isn't fast enough?

  • Default User Avatar

    I'm ok with him linking to the documentation, as long as the link remains valid(which it might not be someday). Searching documentation is frequently a big part of programming.

  • Default User Avatar

    I agree, I wish they'd show you the test cases. You can simulate it by simply printing the input for each test case before the case fails or passes, and address them one at a time as you pass each successive test case, and the next one prints.

  • Default User Avatar

    I had this same problem. I simply tested for hex string and not for case. This should really be clarified. Wasted a good bit of my time because of this.

  • Default User Avatar

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