3068. Find the Maximum Sum of Node Values - Day 20/31 Leetcode May Challenge 

nopes i found it hard but i will try later lets just like the vid first will try by my own first.

Nope :(

I'm at day 142 of my streak. The last few days I feel that I have lost strength/will and have little energy. I feel that I concentrate less when I start to solve a problem and give up more easily. I felt I gave up to problems that I could probably solve if I was less burned out. Has this ever happened to you?

I talk about it here - ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-dDEneqyWsI4.html but really it's just more practice, but trying to do it deliberately

It's okay to take time off!

we can even optimise to O(n) time and SC O(1) space by optimising space in dp

or simply also keeping the track for the minimum addition that we were able to do by the xor operation i.e min = Math.min(min,num^k-num) this way if at the end the count says that there were odd number of xors we could just subtract min from our total sum! This isn't mine i saw at as the solution after realising oh this was done in 1ms runtime! Simply beautiful TC O(n) SC(1)

What if we apply dp on edges, like we have a set of edges, we have 2 choices either we choose or drop the edge... and every time we choose we update the corresponding nodes and recurse again.