Thank you my friend

You can create a new fork and approve it.

Can't be approved, description changes.

Lua and Dart approved

from string import ascii_lowercase will give you a variable (type string) called ascii_lowercase which equals 'abcdef...wxyz' (ascii_uppercase works the same way)

You're missing g, h, and i there. So, the right alphabet's position is 10, not 7 as you said.

Does anyone occured with "j" letter numeric problem? I tried to generate "a1, b2 c3" with different ways (first one through "for" array generation and another one with charCodeAt method). Both times for "j" returned alphabet's position were "10", instead of "7" as it is in reality.

Here: "['a', 'b', 'c', 'd', 'e', 'f', 'j', ..."
returned [1, 2, 3, 4, 5, 6, 10, 8, 9, 10, 11 ...]

*May be it's linked with 'j' using in nested arrays counting?

"What is the least amount of times you should concatenate a in order to find b inside of it?"

For example:

a = abc
b = bcac

expect: 2
abcabc -> _bca_c -> (ignore letters we don't care about '_') -> bcac

len function is unnecessary here, as the problem statement specifies that input is a triplet.

you need to create a function that when provided with a triplet, returns the index of the numerical element that lies between the other two elements.

I fixed the java translation. The kata is already done.

https://www.codewars.com/kumite/5a9b035cfd5777a6f8000114?sel=63470c5875d527c4dc3aff01

.

Description doesn't make the task that clear, might be worth updating it?

Do these still need merge conflicts fixing?

I can do so if needed.

Update to Scala 3

Approved!