the solution has: Time 𝑂(𝑚loglog(𝑚)+𝑛(𝑚/log⁡𝑚)), Space 𝑂(𝑚)
where 𝑚 is max value from a given array

the illegal values! xD

agreed

It's not correct, OK? Think about [15, 30, -45] in this kata's description. Such solutions without prime-checking shouldn't pass the kata.

one of the few calculation katas without big numbers and people still copy pasting. smh

Thanks for taking the time to explain that. I love regex but didn't know i could do this with it.

what do you mean by this? url.indexOf(p1 + '=') < qPos

Wow, so much clearer than my solution :'(

Bit sad given it's not exactly a tough problem. I wouldn't even know how to Google for this, though. I feel like if you knew what terminology to Google you already have a math background.. so wouldn't that make this even easier? This solution is also quite slow.

Considering amount of coders submitted the exactly same solution, this one is clearly copy&paste from internet.

One or more characters that aren't a question mark or an equals sign.

Could someone explain what [^?=]+ does in this regex?

Since Array would start with 0, I guess to make sure the last item in marked[] will corresponed to the largest num (in abs) in the lst[]? This way if that num itself is a prime number, say 101, this prime factor, i.e. itself, will also be included in the calculation.