This was a solid reminder to reread what is the required output, I wrote to output missing cones visually as a grid, just to wonder why it's asking me for a string lol.

Ah, didn't need a reminder how much I was annoyed by this problem lol.

I don't know if you've read my followup comment, I fixed the algorithm now and it's Passed: 480 Failed: 46, the 46 are all edge cases for -1 which I am yet to implement.

You are correct.

Passed: 480 Failed: 46

Vastly improved the solution, the 46 failed are all edge cases that are supposed to return -1, guess I'll have to figure that out hm

I see, but how would 114 be expected from 414? Shouldn't it be 144? My program outputs 144, I thought the premise of the problem is the next lesser permutation consisting only of the original digits, 114 is 2 1s and a 4 from the original 414 (2 4s and a 1), and other such confusing inputs which simply seem incorrect, not to say my solution is proper nor flawless but there's numerous other people complaining about incorrect expectations for solutions, I'll keep testing but I'll definitely have to postpone this kata a bit as I am a bit annoyed by it at this point.

Passed: 106 Failed: 445

A lot say it should be wrong result, or I am misunderstanding the kata, i.e:

5500 should equal -1 shouldn't 5500 equal to 5050? When I run it the output is 5050

441 should equal 144 when it should be 414 etc.

Interesting...

huh, apparently I did, I thought this was just regular discourse, mb

I never said anything about a kata issue, I just said it's interesting because I'll have to figure out a faster method.

Passing all tests but timing out due to long runtime heh, interesting kata.

def solve(a, b):
isEviternity = 0

for i in range(a, b):
    if all(char in "358" for char in str(i)):
        count3 = str(i).count("3")
        count5 = str(i).count("5")
        count8 = str(i).count("8")

        if count8 >= count5 >= count3:
            isEviternity += 1

return isEviternity

Well... that's a winner lol

First name Brute last name Force, admirable.