"You will be given two strings a and b consisting of lower case letters, but a will have at most one asterix character. The asterix (if any) can be replaced with an arbitrary sequence (possibly empty) of lowercase letters. No other character of string a can be replaced. If it is possible to replace the asterix in a to obtain string b, then string b matches the pattern."
For me ut is simple as that.
Can you give me any example when my sollution is wrong ?

0 will return true this is a issue here ;)

yes it is
https://primes.utm.edu/lists/small/10000.txt

My bad sorry;

[1,4,6,8,9,10,14,16,18,19,40...]
so solve(10) should be 40 not 44 am i wrong ?

81 fruits, 9 bananas it is 1st test.

so 9 bananas +3 apples+ 20 oranges+12pears+22lemon=66 fruits ?
so somthign is wrong there in my opinion or description isnt clear

In my opinion the eaziest way is switch css class to:
.capitalize{
text-transform:capitalize}
or
document.getElementById(id).style.property = new style
but both are imposible at these test ;/