Ok, I see...so when you change a letter it counts as a single operation...I was counting it as 2(removing then adding).

The example is fine.
With Java, you need to do the following : Add an H, change the J for an E, change the second A for an E and finally add a N.
That's 4 permutations compared to Python's 5 (Change P for J, change Y for E, change T for A, change H for V, change E for N).

EDIT : Typoes

Think mathethematics...what you are doing is wholly unneccassary...

Forget looking at letters, and think mathematics. There are equations that can be used that will be exceptionally fast...

Im a little confused.

In the example given with the different languages, you say "heaven" should return "java", but from the way I'm seeing it, it should return "python".

"Java" compared to "Heaven" has no letters in the correct place, even though it Contains 2 letters from heaven(a and v) meaning you have to move/replace all 4 letters, then add 2 to equal the length of heaven, which = 6 total.

"Python" compared to "Heaven" has the same number of letters and the "n" are both in the same place. Meaning only 5 letters need to be replaced in total.

What am I missing here?

EDIT: Even when I used a count to keep track of letters from "heaven" that were simply "in" "java" and "python" and then subtracted them what I had came up with, python STILL is the answer because both java and python both contain 2 letters that are in heaven.

Either the explanation of what you are wanting us to actually do is not clear enough or the test is simply wrong.

It is pre-loaded code for you, so you don't have to type it out and example of using it would be...

console.log(MORSE_CODE);

Where is this Morse Code Dictionary that is preloaded?

This shift one letter?

Error messages on python katas are of the form "wrong response should equal expected".

So, if the first test error message says 'Ok, Ooooo?Okk, Okkkk?Ok, Ooooo?Okk, Okkkk?Okk, Okkkk?Ook, Ooook!' should equal 'H' it should mean 'Ok, Ooooo?Okk, Okkkk?Ok, Ooooo?Okk, Okkkk?Okk, Okkkk?Ook, Ooook!' was the answer you provided ( instead of H ).

Getting a very stange incorrect on the first test saying:

"'Ok, Ooooo?Okk, Okkkk?Ok, Ooooo?Okk, Okkkk?Okk, Okkkk?Ook, Ooook!' should equal 'H'"

That long string most certainly does not equal the letter 'H' in the example, nor in the test, which has ! instead of ? as given in the example

I've had a few completed Kata's that earned me no honor...

Is it not ironic that a coding challenge site has an issue with their coding? :P

Thinking something is not right with these tests...

specifically tests 3,6 and 8...

I encode and decode them correctly, I have checked the Console.WriteLine output in both the message and the list and compared it to the shift being used in cases 3 and 6, and in case 8 it tells me it expects a string with Length 113 but mine is 90 even though my Console.Writeine output directly below the input string is exactly the same length...

In case 3 and 6 is tells me it the output is different in list at index [4] but it is using the wrong shift on that index it appears...

Can someone check my code and verify I am not going crazy??

use a recursive function---a function that calls itself as the return value.