also, read the comments!

it is the for-each loop in java.
https://www.geeksforgeeks.org/for-each-loop-in-java/

can anyone tell the use of i ":" arr in the for loop?

This is the most poorly written and kryptic problem on this website ! It insults the reader and the website, by forcing us to submit many many time in order to figure out what this problem actually asks for.

please explain that:

• lower case letters are only encrypted in other lower letters
• same for uppercase
• explain how you split the result in 5 parts - I still do not understand how

The challenges of this kata are those of an 8 kyu, but because the description is so poorly written, to a point it becomes malevolent (it hides details on purpose so that your tests fail) it requires the work of a 2 kyu kata. I have put in a few hours, and feel insulted and sad by this pointless effort.

Thank you so much for posting this! It helped me actually solve it

A problem that does not need any special features or functionality of GO. It only takes the most basic notions of programming, thus a great problem for any begginer.

One small note: you do not get 12 seconds for each test, but instead in 12 seconds all the tests must complete. Somehow this was not clear to me when I started it.

And also a suggestion: bring more 1 kyu GO problems. It is a shame that for such a powerful language codewars only has one 1 kyu problem.

You can translate it to Java if you want :]

This has been happening to me for the past week. I don't know what the problem/solution is.

It has no Java.

Indeed take a look at the formula for points: points = numberOfDamagedShips * 0.5 + numberOfSunkShips - notTouchedShips

The random test is broken. Only 99 people, and invitations are in the form (182, [200, 334]). Why are these numbers greater than 99 ?

WHy is this problem in the graph section ? I believe it has nothinh to do with graphs.

Thx ! This is very usefull info. I shall try refactoring my code.

that's not a failling test but an exception that your code is raising when it's executed. Too much imbricated parenthesis (each parentheses pair is equivalent to a recurcive call, so you did saturate the heap space). You'll need to rewrite a bit your code. ;)