Its been months since you reply but if you are still wondering when we measure how much time it takes for an algorithm to finish, we do not measure in time but in O(n), you can search the Big O notation(if u havent already) and youll see. btw if im wrong someone correct me im a newbie aswell.
It can be simplifed even more using constant space
i see everyone talking about 'O(N)' and that kind of stuff what does it all mean. i am a newbie by the way.
Thank You! Glad to see in codewars someone concerns about efficiency.
It is even possible to determine the day of the week for 1 January without new Date().
P.S. Sometimes I do much stranger things...
I just learned the join method, so I decidied it would be cool to use it in this problem. Thank you for your help :]
This comment is hidden because it contains spoiler information about the solution
System V ABI / AMD64 / LP64 https://github.com/hjl-tools/x86-psABI/wiki/x86-64-psABI-1.0.pdf
That's true, thanks!