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.

.

nevermind, i just found out

(a = classpoints_sumatory) (b = notes_count) (c = mynote)

a / b < c -> (b) * (a / b) < c * (b) -> a < c * b

cant get the logic behind, can u explain please?, whenever it's possible

Description mentions caching the results, but it is not tested. Either this should be a requirement and hence tested, or should be removed from the description. If you require caching, how should void functions be dealt with? The description could benefit from clearer guidelines.