Look at TenC comment here. It demotivated him so much, he didn't make it past 8 kyu. This is why it's so important. The next comment is by a 3 kyu programmer, who additionally expressed much time was wasted.

Same problem)

Using a loop that repeatedly tries to adjust the two sets until they are correct is not the best approach.

It might help by looking at the example of n = 8. The sets [1, 3, 6, 8] and [2, 4, 5, 7] work, and there's a pattern there. Can you extend that pattern to other numbers? If so, which ones?

By looking carefully at examples for a few low values of n, a general solution can be found that generates the sets directly, with minimal computation.

It's a bit hard tbh. I found a solution to it but wasn't accepted because of timing out.

The exercise makes sense after reading this explanation.

The description states:

Note: m, n, f, b, c are positive integers, where 0 <= m <= n or m >= n >= 0. m and n are inclusive.

good job

[0,11,9]//Sam, [6,7,8]//Frank, [4,3,2]//Frank

I even set a default parameter for function addOrChangeUrlParameter(url, val = ""), but not working (Cannot read property 'split' of undefined,) It IS defined, always, even when not passed in..

and I :(

Did you mean "nice kata"?

oh i think too!

Q Q Q Q Q (first line : 300)

and :

x x Q x x

x Q x Q x

Q x x x Q (+ 300)