Run my code today again, it passed. Not really sure what happened, but the case is as I wrote that came from print statement.

I dont understand how this suppose to be True: is_merge('Can we merge it? Yes, we can!', 'wegeit Ys en!', 'Cawemre t? s wcan') in python. the first match is on Ca then after there is no n.

c#

Input: 59884848493558, Expected: 59884848483559, but isnt the next biggest number: 59884848493585 ?

I think, this is a logical issue. It is very plainly explained, however in one case you insert the bigger number after the smaller in the other case you insert the smaller before the bigger depending which index is smaller that means other cases have to be the same other wise that does not make sense in other test cases. You are making a trade off for the smaller one, but that you do not say by which rules the trade should be made. For instance,

    testing(209917, "[29917, 0, 1]");
    testing(285365, "[238565, 3, 1]");

By your logic the second test case should be

    testing(285365, "[238565, 1, 3]");

You preoritaze one index instead the other.

In my comment I gave Javascript as an example, the point is still I believe to be fair.

The point that I want to state here is that for some languages some problems/kata's would be much harder than for the others like c#. I have not really studied much beyond java,c# and etc. However, the kata level should be as well broken down to the language it is being solved with. For instance, if, I assume so, it is much harder to solve some problems/kata's with Javascript as the language does not give such possibilities as c#, and vice versa. If one moderator is good at Javascript let him rank the problem/kata in Javascript language, and another moderator can evaluate it with c# if he is good at it. I think this differentiation will want a big upgrade, but I believe it is worht it.

Maybe I am the only one that does not understand, but why is this kata 4 kyu? I dont know maybe my point is not very valid, but as languages get developed it becomes easier to solve some problems, like this for example, it took me less than a minute to solve it with c#. The point is that for some languages this problem would be much harder than for the others like c#, I have not really studied much beyond java,c# and etc. However, the kata level should be as well broken down to the language it is being soled with. For instance, if, I assume so, it is much harder to solve it with Javascript as the language does not give such possibilities as c# why is it ranked for c# as 4kyu?

And should the katas level not be reviewed over time as well?

Very easy, kata and it is strange that you took it from euler, I just copied my code I used down there basically.

Please check the test cases for c#, this is hilerious. I am able to provide screenshtos that do not bring any logic https://s12.postimg.org/8ophec3b1/Capture.png the number on the right is the number that was supplied and left is the number from the awesomePhrase. As well I am able to provide screenshots from the main test cases.

Good Kata, bit disappointed because of overcomplicated the kat'a for myself, though yes still it was easier than some of 5 kyu katas.

Good kata though should be 5 kyu not 4 kyu.This kata is much harder and is 5 kyu http://www.codewars.com/kata/twice-linear ,I am still solving it and this one is done in less than 2h, how come?

Good Kata, Though would concider it to be 6kyu.

Strange enough my code passes all the test in the nth fibonacci kata with, but this one with fixed signature it does not. That is why I agree with the perso who created the question.