filter give only the matching chars then length gives how many chars are left. if total matching chars are 5, filter keeps 5 chars and remove all not matching chars, then length give the total length of remaining chars.

Return the shorter of the two input parameters, then the longer one, then the shorter one again, concatenated in that order.

Fixed.

Split returns an array, filter goes through that array looking for in this case a letter, and length returns the amount of elements in that array.

Hello Tyler, the array is [6, 2, 1, 8, 10], the highest element is 10, the lowest element is 1, the sum of all the numbers except the highest and lowest element is 6 + 2 + 1 + 8 + 10 - 10 - 1, or simplified 6 + 2 + 8, which equates to 16.

Click Reset and try again.

Your function doesn't return, not a kata issue.

balu9, in C it can be solved with an if and two built-ins, if that's not an 8kyu kata I don't know what it is.

He is right, it's not about complaining , this kind of stuff will frustrate a beginner, atleast the author will take care of the ranking from next time if we point it out

what does your solution return for n=100000000000?

Bug in your solution is not a kata issue.

Fixed.