I thought about doing this at first, but I wasn's sure how to whittle it down this small

smart! 0.0

how is this best practises? I don't see anything being done the "best" way.

I will unmute you tomorrow.

You can definitely make the argument that the average of an empty list is undefined because [0,] != [ ], and that returning NaN is more semantically correct. Saying it SHOULD be invalidated is a tad strong. There is a convention stating that the sum of zero elements is 0, but I don't know of any convention stating that the average should be 0. Imo an empty list can't have a well-defined mean.

you picked the wrong language, should have picked C instead

could you solve it using recursion function?

Looking nice, but isn't it rather C-style than C++?

Eh sometimes you gotta use it, not here ig. This can be done in O(1) without any loops

Matematik problemiyle yapmayıp, Max Buffer Size Reached (1.5 MiB) gördükten sonra n(n+1) / 2 kullanıp kendimi çok akıllı hissettikten sonra submitleyerek gelen Rusça alfabenin google çeviriye yansıyan görüntüm olur gibi.

using map here is actually really smart

still clever for setting init to a double

Not sure, but I think may be the fifth(last part of string) %d holds the 'end of the string character (or so called null termination) "\0"'.