It's just short, nothing more.

O(n) should be clever or best practice. Not this! This is awful solution.

Where did you check the cube value of each digit?

lol smart but should not be allowed

Loved the use of and operator

data[ptr] = (data[ptr] + 1) & 0xff;

The regex doesn't work if paramatres are set to more than one character.
E.g. stripUrlParams('www.codewars.com?a=12&a=34');
This should work: /&?([^?=]+)=[^&]+/g

The more I look at it, the more I like it.

You're perfectly correct. I didn't anticipate that approach when I designed the test cases, I'm afraid, and since the kata is published, I can't change or add them now.

The chance of a random test case catching those solution is also rather small, unfortunately.

From another perspetive, they actually solve the problem as stated in the description, even if that was not my intention. :-)

Thanks for the feedback. :-)

(You have a tight and readable solution, too, btw. Nice!)

We've got a rebel here.

Your solution fails for this test:
isMerge("catodc", "cod", "cat"); // should return false, but yours return true

What a horrible piece of ... kata.

Finally somebody with IIFE solution. I thought I was alone :D