yeah, the same thing happened in MULTIPLE renditions, especially in JavaScript. I lost track of how many coders had something like that in their preloaded but didn't have a clue it was there when they published, lol

The fact that the definition of class _() stayed in that forked code is quite funny.
It's also showing how hard it can be to maintain a good architecture even for simple code, because when you are not the one that made the code, you don't know the location of every piece of code, and you easily forget to remove some.

Glad you enjoyed ;-)

Nope, all translations welcome;-)

Thank you so much for this brainstorming kata. Through pain and suffering finally got it. It was a good experience for me.

Is it possible to implement this without using a for loop in other for loop.

Thx :)

no advance topic and (no recursion)

just understand complete problem and solve it step by step

just to get you boost

• find corners
• sidelines and etc...

May I ask for some little hint, as a beginner? What advanced topic (data structure or something) do I need to know to complete this?

Don't use too many loops, and make sure they are as simple as possible. Also, a change of approach maybe? You would've solved a 5kyu without performance measures, just know that.

I'm confused, is

a = [2; 2; 3]
b = [4; 9; 9]

supposed to return true or false?

Yes, if you click attempt, I can see your current solution so far.

Oh, thanks. I will try to optimize code.
And... I'm sorry. I am new to the codewars. Just would like to know.
You can see my unpublished code for this task, right?

Your code is similar to bubble sort. Bubble sort is one of the slowest sorting algorithms, so no surprise that your code is very slow. Try using less for loops and ecspecially not switching each one.