Did you convert the strings to upper case?

{
    "A": "@",
    "B": "8",
    "C": "(",
    "D": "D",
    "E": "3",
    "F": "F",
    "G": "6",
    "H": "#",
    "I": "!",
    "J": "J",
    "K": "K",
    "L": "1",
    "M": "M",
    "N": "N",
    "O": "0",
    "P": "P",
    "Q": "Q",
    "R": "R",
    "S": "$",
    "T": "7",
    "U": "U",
    "V": "V",
    "W": "W",
    "X": "X",
    "Y": "Y",
    "Z": "2"
}

That's weird. I just solved it using the map from the description.

I suspect you are referring to the Java translation.

To which language are you refering? Not Python, I presume.

Not a suggestion.

Remove the parentheses of the division.

A single loop is O(n), so your code won't work, read Ravenous post and try again.

Use proper markdown when posting code, otherwise it's hidden and we can't see what you posted.

Read the instructions again:

Given a number n, return the number of positive odd numbers BELOW N, EASY!

So the right answer is 7, not 8 for 15.

The timeout is related to this:

Expect large Inputs!

Try a faster code, your code should be O(1) to pass the tests.