Earn extra honor and gain new allies!
Honor is earned for each new codewarrior who joins.
Learn more
  • Hey @ccombe I also hit the recursion limit and was able to get around it by combining the repetitive operations. I recommend printing the inputs and looking in the logs for a pattern :)

  • If it's worth anything, I can tell you i don't think this kata is 7 kyu. I think that even if solution looks simple, it's not THAT easy to get to it. Don't get discouraged, and keep trying :)

  • OK looks like I can get past the repeating line error and now I can solve 116 with 91 failing and it seems to be there I have largeish numbers that don't quite get clos enough to eachother. Time for bed - ill keep trying tomorrow.

  • Thanks that is helpful but it's almost midnight here and I'm running out of ideas.
    I think I need a way of being able to check if the line will repeat again (many times) because the value or either a or b is so large that it needs to be reduced significantly.

    I woudl think checking to see if the difference between the a and b is > 3 * a or 3 * b, then set a = 2 * b or b = 2 * a but that doesn't feel right.

  • Note how in previous post you have this: [previous line repeated 996 more times]. Maybe you could find a way to avoid so many identical lines? It should not be difficult. But yeah, I wonder if still in scope of a white kata...

  • I'm losing my mind on Python.

    I keep hitting the recursion limit which seems like a Python gap compared to other languages but then I assume I'm doing something stupid with my logic - however I see a lot of others having the same issue with the same test.

    solve(100000000000,3)

    Any suggestions for how to best approach solving this or if there's a specific feature / approach to trye would be appreciated.

    Should I be looking into generators and yields as an alternative?

    Amy suggestions / tips are appreciated.

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

  • hitting a recursion limit is a problem of your solution

  • I think there are some issues with cases in attempt:

    solve(100000000000,3)

    elif a >= 2b: return solve(a-2b, b)
    [previous line repeated 996 more times]

    RecursionError: maximum recursion depth exceeded in comparison

  • I have the same problem, i pass all the tests but get a SystemStackError

  • seems like it wasn't me but the kata itself afterall hehe

  • Please check your code. If you need help with it, please post it as a Question, not an Issue. The Kata is Ok. Please check how many solutions have passed in JS.

  • Javascript: Basic test in 'TEST' passed, but the same test in 'ATTEMPT' did'nt:

    Test Results:
    Basic tests
    Test Passed: Value deep equals [6, 7]
    Test Passed: Value deep equals [0, 1]
    Test Passed: Value deep equals [0, 1]
    Test Passed: Value deep equals [2, 2]
    Completed in 4ms
    You have passed all of the tests! :)

    =============================================

    Test Results:
    Basic tests
    Test Passed: Value deep equals [6, 7]
    Test Passed: Value deep equals [0, 1]
    Test Passed: Value deep equals [0, 1]
    Test Passed: Value deep equals [2, 2]
    RangeError: Maximum call stack size exceeded
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    at solve
    Completed in 6ms
    Random tests
    Test Passed: Value deep equals [10288292, 9492336]... etc

  • Try to recreate the problem in our IDE. See here to find out what input causes it to fail, and see if the same input works in your IDE.

  • Did you return or print the result?

  • Loading more items...