wow, like a stack, amazing

Generally, bit shifting is faster than multiplication because it's physically implemented on the board. However, almost all compilers automatically replace multiplication by a power of two with a bit shift, so there is no difference.

Thank you for pointing this out!

is inline coding that sacraficed some readability in c++ considered best practice?? I've heard to code in more readable multi line ways so im curious if this makes the code run slower compared to your solution

This may seem cool, but for larger vectors, this method is way worse because std::stable_partition is harder to optimise by compiler.

avg of classPoints < your points .

the task is to use the template you're given. you used an extra include

Brute-force solution, runs in O(n^2). Don't do this please, use a hash map instead which runs in O(n). Please, this is important for everyone.

How about asking for each digit n times instead of 1?

Enabled in this fork

this methode needs Big brain to understand backtracking solution !

This is made by AI chat. It gave the same result. This solution also has a problem. When we have vector with letters a b a, it would return a b a as unique vector instead of a, b. Because it check only last element in result vector.

.