1 comment ❤

Bro Just I felt love with ur teaching u know. After stiver I felt like u are the most adorable teacher I have ever seen .

This was today's daily. Thanks !!

Thanks, but I have a problem. I understand all of this except finding baliKaBrakra

unbelievable! how I can come up with the solution by myself :/ ?

This was totally a Math question for Olympiads, this question can never come in interviews. That's what i found, even thought i understand the code and you explanation but I am not going to submit it on Leetcode because i never going to get the intuition of this solution by my own. But thanks for explanation.

Amazing explaination , very amazing logic , ❤❤

wonderfull approach and explaination ❤

best explanation for this question.

Thank you for good explanation and good mood ))

Very good explanation sir🎉

Great solution aryan!

Great explanation bro! Keep it up :)

very good explanation, thank you :)

Awesome Explanation Aryan

Hi great content .. have wached a lot of your videos ... great help... just a little feedback .. videos are really long I mean explaination is bit slower ..even 1.5X seems slow ... can improve on less repetition

Subscribed seeing Bali Ka Bakra usage

Oh my god Edges vector is not required at all💀💀💀💀💀💀💀 Tree->normal array

Nice video man very good video

awesome bro

How can you be sure that the sacrifice made is good? I meant that what if the odd one (the one for which we're finding a pair) which increases the result by "x" is less than the baliKaBakra (value by which the result decreases)? In that case, it would be good if we don't increase that odd one.

So edges has no role to play in this question, that was given redundantly to us.

Understood

@kavangondalia688 already rasised this question. now are contributing nodes are odd and how can u judge that balikabakra leaving is always a good one. There is the possibility that balikabakra lets say it has node value 9 and it increases to 15 and if we take a node which is original 7 and for some k it decreases to 5 in this case simply leaving the node 9 is not good right

Bro contest upsolving pls ❤

What is your rank ?? In today contest ??

what is the use of the edges in the problem? you haven't used it anywhere.

🎉🎉

class Solution { public: long long solveRec(vector &nums, int k, vector &edges, int idx, vector &dp) { int n = edges.size(); if (idx >= n) { long long temp = 0; for (int x : nums) temp += (long long)x; return temp; } if (dp[idx] != -1) return dp[idx]; int iZero = nums[edges[idx][0]]; int iOne = nums[edges[idx][1]]; nums[edges[idx][0]] ^= k; nums[edges[idx][1]] ^= k; long long l = solveRec(nums, k, edges, idx + 1, dp); nums[edges[idx][0]] = iZero; nums[edges[idx][1]] = iOne; long long r = solveRec(nums, k, edges, idx + 1, dp); dp[idx] = max(l, r); return dp[idx]; } long long maximumValueSum(vector &nums, int k, vector &edges) { int n = edges.size(); vector dp(n, -1); return solveRec(nums, k, edges, 0, dp); } }; Bro why this solution does not work? It is giving correct answer without optimisation, but as i optimise, it is giving wrong answer?

Your age?

ghanta samajh ni aya kuch

bhai mehnat to kar raha h lekin samjh nhi aa rahe tumhare samjhae soln

bhai yaarr tu acting bhut karta hai😮‍💨