There's no point in returning the number of matches.

The description is seriously lacking...

• What exactly is a capitalized word?
• Why is "A." a valid word? (and why is the expected output without period?)
• Why is "ABC" invalid?
• What about "AbCDEFG" ? "ABcD" ? Are those valid or not?

Clear rules or examples need to be presented.

Tests updated, description updated.

I'm not saying that my code is the most efficient, but I will say that I'm making a single pass through the array in javascript and timing out. I'd understand it if I were doing multiple passes but I don't understand why a single pass should ever make it time out.

thanks for your input and time. I am inspired by this to keep working on it. I have cleaned up the examples and test cases and edited the description. Over the weekend I will focus on introducing randomly generated tests.

On the Wiki page ( linked from the left menu ) there is a link "Creating your first kata" on the very first page. Read that in full, and look at the tests of kata you've solved - most any of them should have random tests.

Please note that "This is not new" is something that's hard to solve without real changes to your kata - you'll need to make your kata unique, because you can't very well unpublish other people's kata ..

Hi thank you for the feedback. I would like to fix any issues to imporve this Kata.
I am finding the randomising of the test data confusing, is there a link or model of how to do this?
thanks

• The Example tests are not really representative of the requirements of the Submit tests.
• I really don't understand what ( well, how ) Model:: string => array [,] is trying to convey. If you intended to write a Haskell-style type signature, that would be something like capitalWords :: String => [ [String], Int ] ( JS unfortunately doesn't have tuples ).
• return value [ array, thatVerySameArray.length ] is redundant. Just ask for array; if you want to know its length, look at its length property ?!? You could also just ask for the regex as a constant and .match it yourself, but people are solving it differently.

This is not new.

Also, needs random tests.

NOTE: There will also be lists tested of lengths upwards of 10,000,000 elements. Be sure your code doesn't time out.

That's the reason, not unknown.

using import math makes this kata trivial and boring (I mean, why bother?).
THE REAL CHALLENGE is to do it WITHOUT the sqrt or similar function...