Thanks for explaining this. I was trying to wrap my head around what all this algorithm is doing.
What a superb explanation! Thank you, you definitely helped me understand what's going on in this code. Cheers mate.
hey bro. i cant understand this...
I know what you are saying by this comment. Does this way of solving the problem still work in java?
Great, thanks for your reply
Thanks for your reply.
Actually I have struggled on this kata for a whole day.
And is there any other workable solution?
I just need some confidence.
I'm always failed to attach.
It always compains 'Unable to get pid of LinuxThreads manager thread'.
And I'm sure the current pid is always 1.
Can you make sure if this way is still feasible.
This took FOREVER to figure out by the way. The linked source is what really gave it away for me. I only picked up Java in the last year or so professionally so this was a pretty deep dive into what was actually going on in the dark underbelly of the JVM.
Once I realized you could actually compile a class at runtime, that's what gave me the correct search parameters to find the link.
Explosive Sums does not have a Rust version.
Did not see your first post due to CW's noti system.
// Next time when you post a spoiler post, you can post another non-spoiler post if you want to be noticed.
Nice to see you again. Thanks for your interesting post!
I think jcsahnwaldt means that in some JAVA testcases the highest day number > 365. This is correct, however it does not happen all the time. The solutions that ignore day numbers higher than 365 are accepted.