BUGGY solution for Intermediate Algorithm Scripting: Spinal Tap Case challenge

It was already mentioned that it is buggy but it is still there:

This solution may work:

Solution
function spinalCase(str) {

  return str

         .split(/[\W_]|(?=[A-Z])/)

         .join("-")

         .toLowerCase()

  ;

}

I don’t know if they would add it to the existing solutions because it is really similar to solution 3.

But I guess we will wait and see what the pros think.

It is not only similar to solution 3, it is the solution 3 altered, because solution 3 is flawed aka buggy.

Well we are going to have to let the pros weigh in.

You might also want to move it to the contributors section if you want them to consider adding the solution.