i like that you considered a class for this, but it's overkill

when i get sad, i go to code wars, solve something, go to solution, then i'm sad again

i knew it should be something like this but i just can't wrap my head aroud it. nice one

It seems to be. Thanks!

Rust translation

this one is good

should be fixed, can you check ?

I must apologize. I wrote this deeply frustrated as I am just starting to learn programming and I could not see the logic behind this kata.

It would be very educational to look at the solutions. Or come up with a solution which does not time out. Like, really.

The sample test

test.assert_equals(solve("codingIsFun",2,100),"conuFsIgnid")

shows that if the second index is past the end of the string, you simply reverse from the first index to the end of the string.

"The first index a will always be lower that than the string length;
the second index b can be greater than the string length.
More examples in the test cases. Good luck!"

the second index b cannot be greater than the string length else it will be out of range.

can someone explain me the instruction?

i know man, same boat, i can't get the pattern since it only gave one example

i also don't understand this part, im thinking it wanted the 1st item to be higher from the rest