Far too few test conditions for URL checking. Need different protocols like ftp, https, etc.

I think this is possible to solve without name being private. Does it check to see if name is private?

In the TODO line, the word 'much' should be replaced with 'many'. It is currently gramatically incorrect.

When on a user's profile, hovering on the "Unfinished" button under the Kata heading reveals a popup with a typo. It should say "but" instead of "buy."

Also, every time in the notification tray (the globe icon in the upper right) is the same, and is reset every time a new notification is recieved.

According to the MDN, defineSetter and defineGetter are deprecated and should not be used. Seeing as this is currently the top solution, I thought I'd mention it.

It should find indices of two different items in the array that, when added together, give the target value.

I found this sentence misleading. This sentence implies that the indices be added to get the target, not the values at those indices. Please consider rephrasing this to be more clear, thank you.

How are the solutions being tested for recursion? What's stopping people from not using recursion?

You may also want to explain what recursion is in the description and provide links for people to learn from.

Also look into specifying the difference between tail recursion and normal recursion.

That's what is throwing me off. Where is the function we're supposed to be using? Do we need to make it? This kata is extremely unclear and should have some references to explain what is expected.

Very cool, I enjoyed it a lot. The only thing that wasn't apparent to me when reading the instructions is what happens when there's an array like the following: [1, 2, 2, 2]. If it ends in a plateau, it doesn't get counted as a peak. Maybe that should be stated in the description? Awesome challenge regardless, thank you.