Given $$$n$$$ and $$$k$$$, Maximize $$$(a_1 + a_2 + \dots + a_k)$$$ such that $$$a_1 \oplus a_2 \oplus \dots \oplus a_k = n$$$ and $$$0 \leq a_i \leq n$$$.
I created a video discussing the concept of Tight in Bit manipulation and how to apply it to this problem









I don't understand why blogs that contain educational videos like this are getting downvotes? A lot of unnecessary cheating related and clickbait material gets more upvotes too. I humbly think, we should support content creators like him who create educational videos. Or else, atleast have the courtesy of letting him know why we are downvoting his blog.
I did not downvote, but if I did it would be because of the lack of written content.