This is such a cool solution. Rotating the matrix 4 times and then just counting for bee is such a neat algorithm here. It took me like 10 minutes to completely understand it.

Absolutely. Thanks man.

woah, we have access to lodash using require?

Is there a list of exposed modules for us to use somewhere?

You'll need to find a more efficient algorithm than actually storing the names in a data structure that keeps getting larger.

Yes, even though the description makes a big deal of the order of names and spelling, the names array is GIVEN, so you don't actually care at all. The random tests do include other arrays with more or less names.

Okay cool, there was an issue in my for-loop starting at the wrong number. Thanks.

Doesn't the fibonacci sequence start with 0,1 and not 1,1?

I am fine if you post your code here, as long as you mark it as a spoiler.

Without seeing your code, all I can say is that you need to make sure that none of the objects in the array already have that phoneNumber. Another way to think of it is that ALL of them don't have that number. Either way works, whichever one you can understand easier.

Could you explain how the first 3 work? I see those and have no clue what '..' or ' .' are doing.

I'm quite sure that I fixed your concerns, could you mark the issue as resolved?

Okay, I added the Test info in comments like most other katas do. That is what you were asking me to do, right?

Okay! Now I understand what you are saying. Sorry about that. I'll fix that right now.

-Edit. Okay, it should be fixed.