Taken care of. Thanks. Unfortunately I have not come across instructions in here as to how each section works.

Interesting. Not the intended effect, but none the less... interesting.

Yes, unfortunately the test engine doesn't always give useful feedback. This is one of the reasons I've not been in here for a while. I found such unpredictable failure to be rather frustrating. If you try validating it again, you might get more useful feedback. Sometimes it just seems to drop the text that should have been displayed. I've asked for help with this someplace in the forums, but... still a mystery.

I think what's happening is that your code is appending the last vowel in your list to characters beyond the alphabet. Try building a test case or two that cover such cases.

I just added an example test case to cover accented characters. Here's the Java version of the new example test case...

@Test
public void tt5() {
  String a,x;
  a = Main.toexuto("José is a garçon at a café in the cañón.");
  x = "Jiosoé iso a gearoçoni ato a caafeé ini tohee caañóni.";
  assertEquals(x, a);
}

Note: Not a spoiler... just an example test case. :)

I have no idea how that got there, but I corrected it. Thanks.
Should have been...
def toexuto(str)

To do...

end

I love your JavaScript solution. It's actually quite a bit like the c# one I had made, which was rather unfortunately lost, but I lie yours better, although my c# one did have an efficiency advantage the the character guessing part (Edit: I took another careful look at your JavaScript solution, and I take back what I said about my lost c# one having been more efficient. It would have been just as efficient, (except for the differences in the languages them selves) because you did it the same way I had. Without my reading glasses on I had mis-seen part, and thought you were incrementing and decrement min and max by 1. LOL! Great work.) My JavaScript and CoffeeScript solutions that I built it with are much less elegant and much less efficient. They just get the job done. :)

LOL! Yes, I did at that. Typo. Corrected now. Nice catch. :)

This kata wasn't meant to be easy. I hope you enjoy the challenge and up-vote it. :)

Interesting. I see your solution, which is quite similar to mine, has no return statement for it if makes it all the way through the for loop. There are several others like that also. So in JavaScript that returns undefined in such a case?

Here's a link to my solution, so you can see what I'm talking about. http://www.codewars.com/kata/reviews/54f9f74e591a7c747500017f/groups/55aa4f6383bad83a36000076

I like this. LOL! The solution with the highest "best practices" rating, and people talking about how inefficient it is. Of course, you're all right. It's pretty though, and gets the job done. :)
Have a look at this one for comparison... http://www.codewars.com/kata/reviews/525099441625e506d500044e/groups/55aa3eaaa85fdbbedf0000a0

Short, fast, compact.

Returns the answer immediately upon finding a pair of data entries where the one to the left is not greater than the one to the right. No redundant searching for more pairs matching the same criteria, as they could not be any farther apart.

For example, in the case of [4, 99, 96, 1, 2, 3, 4, 5, 6, 108, 2, 3, 4, 1, 1, 1, 0, -43, 42, 0, 6, 6, 7, 3, 9, 4] ...
This routine would make one comparison, and stop. Think about it. :)

Ah, there is is. Wasn't showing up here earlier. Much better than my earlier version, I think. Got red of unnecessary comparisons, the vowel r which had originaly been meant to carry the final return value out of the loop, and redundant assignment.

I just submitter a much cleaner and slighlty more efficient version of this. For some unknown reason... I'm not seeing it.

It's not pretty, but it should be very efficient. :) Instead of checking every possible pair, I start with those farthest apart and stop as soon as a match it found. Could I get an up-vote for that, or a Best Practices maybe? :)

No problem. :) I've just made a new kata that's only in JavaScript and CoffeeScript so far. Here's a link to the JavaScript version. http://www.codewars.com/kata/55a9a6ffd7f21d7d000000e5/javascript Let me know if you would like me to add any particular language next. :)