Very slow. Took 47403 ms for 10000000 runs.

Could you explain what do you mean?

I had the same solution, except I don't use the contains() method but directly the add() method in the if, which also tells me that the element was already in the set if it returns false.

Woah it's really long, but i appreciate your originality

Oh, apparently there was a problem with using a static import from JUnit 5. "TEST" worked, "ATTEMPT" did not.

How so? It works fine for me, click Reset and try again.

Java tests do not compile.

it have O(n*n), because sums recalculated for every element of array. and algorithm can't stop on right answer

用的stream流和过滤器以及lambda表达式

Great solution!

可以解读一下代码吗我感觉你的方案很棒！

so clever!

done

This implementation does not protect you from fat finger errors and may therefore be considered bad practice.

What parallel is here for?