I rearranged and simplified the formula for sum of elements of arithmetic sequence, and this simple formula came out.
One tricky part was determining how many odd numbers should be used in the sum, but as I remember it was also represented by some arithmetic sequence.
Now I don't remember the exact steps I have taken but if you want to understand it, you should look at it as arithmetic sequences.
After such decisions, you feel like an idiot...
Nice approach and clean. :)
This is so refreshing coming from Javascript.
very nice
I forgot that Go primitives are not nullable😅
So there are only two possible values for bool
Clever solution!
Nice, i have noticed same pattern from basics tests but i didnt even try it.I over engineered it as much i could haha :O
This comment is hidden because it contains spoiler information about the solution
I rearranged and simplified the formula for sum of elements of arithmetic sequence, and this simple formula came out.
One tricky part was determining how many odd numbers should be used in the sum, but as I remember it was also represented by some arithmetic sequence.
Now I don't remember the exact steps I have taken but if you want to understand it, you should look at it as arithmetic sequences.
How does it work?
done https://www.codewars.com/kumite/5bd124037e21b8910a0000f2?sel=5e346b69617f2d001a4ffc94
Why is the function name
Xorfinstead ofXor?Excellent and concise solution!
In that case, nevermind ¯\_(ツ)_/¯
Random tests are useless for this kata - all possible values are tested
Loading more items...