/([^])\1+/g
1st Capturing group ([^])
[^] match any character (Note: Avoid this construct, use . or [\s\S] instead.)
\1 matches the same text as most recently matched by the 1st capturing group
Quantifier: + Between one and unlimited times, as many times as possible, giving back as needed [greedy]
g modifier: global. All matches (don't return on first match)

To explore this further, go to https://regex101.com/r/zX7aN0/1

That solution appears to work. Only the second argument should ever be undefined (indicating that there are no minor words). What error do you get?

The question is very interesting.It add the type of triangle.At first,we must judge the data that can be a triangle.So we solve the problem at last.

I discovered it worked when I submitted it, but not when I tested it.

this was the solution I used in my browser console. It worked there, but not here.

I can not understand the title at the first time.I can not see it clearly.

Hey,i solve the problem.But when i see other solutions,i hardly understand the "reduce()".Who can help me?

Don't spoil the solution to other users. Instead, mark your comment as having spoiler content.

I do it.But my solution is a little complex.I think that using the "slice" is great.

In my opinion,the key of the question is that you need to judge the even numbers.

Hello,at the first,i want to find the string in the array.If i delete the string that i find in the array,the length of array will be changed.