Though I haven't solved that one, it seems like it is a duplicate of this

Indeed ~~ just found it --> https://www.codewars.com/kata/5831a1d3a31721767b000120

there are random tests as of now

wrong message for this assertion in JS:

assert.strictEqual(condense("1 2 3 1 2 3 3 3 2"), "1231232", "It should condense to out towel into toutowel")

Fork rewriting description

It's probably far from perfect but I do think its much better. I am open to suggestions on it though.

Duplicate issue. And also fixed now anyway

.

Needs better random tests: https://www.codewars.com/kata/reviews/5966fb94ccb55fb44b000e55/groups/62b1cf68c67c0d00015ceb04

The description does not really explain how the algorithm works. It doesn't just combine the last/first 1 character, but as many as are common from the beginning and end of the separate words.

For example, 'fat ata tape' => 'fatape'.

The description has no such example, even though it's made mostly clear by the test cases. This makes it a little more challenging.

Fixed in fork

• that... thing shouldn't pass https://www.codewars.com/kata/reviews/5966fb94ccb55fb44b000e55/groups/614f319d735bbb0001b4a6ad
• the kata should have been updated to node 14 before approval

I feel like that's a dup, isn't it? (or maybe the other one got unpublished, dunno, but I already solved stuff like that).

Thanks for your description. Unfortunately I can't see the video, because it's marked as spoiler :(
I might take a look at it. But I still don't get why just one "e" is removed and not the "v", because in "love everyone" the last 2 letters from love and the first 2 letters from everyone are the same.

So the idea with this kata is to make a function that checks every word in a string and compares values by left and right, it should return a condensed string to its smallest form.
case condense(2112 2112) it should look at the left and right to see if the first string last values are the same as the first values of the second string.
so it would just return 2112 because 2112 ends with the same digits as 2112.
case condense(love every one) it would look at love and see that it ends with e and look at every and see it starts with e so it would remove only one e and concatinate them togather to return loveveryone.

below i will post a link to a youtuber by the name of A Daily Programer and he explains this problem very well.