We can also modify global variable through IIB (Instance Initialization Blocks). You can check my solution for reference.

Just wow

And here I am implementing PriorityQueue with HashMap XD

I work in productive environments with clients who seem specialized in breaking code, with cases that always come out of what one would expect, that is why my solution is broader in terms of lines but sure that it will always give the correct result, in case of values outside what is contemplated, it will continue to give the same result expected according to the rules. In the case of this solution it seems simple but in its simplicity it is vulnerable to a change or a different value

I liked your solution a lot! I could not figure out how to "merge the player experience" /code. But you solved it nicely ^^

I'm new to code and I left a couple questions on my solution. Could anyone please check em an answer me? Thanks in advance, anonymous hero!

Fast solution, however it will produce runtime errors if a dice outside range (1,6) is given. Would never put this in production.

brilliant

That's exactly what I did :)

Absolutely truth, we all feel dumb

Reinventing List.toString() seems like a bad practice.

Just make a list and return it as a String and it will do the [a, b, c] for you

Still, number 11 004 979 is orders of magnitude smaller than possible max. Testing for some close-to-max prime would be more reasonable test (well, assuming this kind of benchmark can be reasonable in general).

Why are you testing on the easiest numbers to check, instead on the difficult numbers?

This code was checked number 2 000 000 000 in 35 000 nanoseconds

So great solutiion.

I used the following method to calculate sumSquareFactors... for loop with i = 2 -> upperLimit where the upper limit is changed each time you find another number that is the factor. so that upperLimit = givenNumber / i. Not sure if optimal.