This kata is a subject to deduplication process here: https://github.com/codewars/content-issues/issues/200.
Please join the discussion to help us identify duplicate kata and retire them.

At this point there is no point to make another kata about binary search: it's already done.

Needs random tests.

The below is an issue. Performance requirements are not enforced by the kata.

The particular JS implementation ( Node ) does not allow a recursive solution ( without a hack, anyway ). You can hardly blame the kata for that. Also, what more warning do you want?

Recursive solutions are not banned.

Duplicate.

I'll just start from the back then.

Would it work to give user a Proxy of the Array and count accesses?

I think this kata might be harder than 6kyu

Personally, I liked this kata as an all time favorite; the data structure searches and creating those data structures just gave me the right tickle in my programming funny bone. Recursion and tracking points already found are the biggest part of this. I would like to have seen more tests.

needs more test cases, I was able to pass by returning manually counted number of expected islands

I had a go at it (a very very long one). I was forced to get help from a java-oriented solution using something called Depth-first-search. today is a very sad day for me :(

This Kata is brilliant. Should have had a go at it before I got intimidated and looked at the solution :-(

I was able to use the same solution I used for the "recursive" version of this kata for this one as well. My solution uses recursion, but my "countIslands" function itself is not recursive. Just so you're aware, not sure how you would test for that, I guess I'm not using the kind of recursion that you are thinking about.

Nice Kata! But it needs more tests.