Distribute Coins in Binary Tree - Leetcode 979 - Python

[@arihantsinghrana2173]

Thank you soo much for making these video and soo early as well!!!

[@tommyshelby6277]

bro sneaked in `ladoos` and thought we wouldn't notice😂?

[@weens571]

Just when I needed the video. Thanks. 😁

[@aashishbathe]

LADDOOO AGAINNN. Just remembering that, I just had it yesterday and it was great!

[@АлекСневар]

Actually, the second solution with one variable is much easier to understand imho.

[@impolitebigmac3044]

I hate leetcode

[@HimanshuSaini-ur6by]

This was great..by 9 minute mark I got an idea and coded it out. it workedd

[@MP-ny3ep]

Great explanation as always. Thank you

[@shashwatsingh9247]

Tough ques. thanks neetcode

[@vedantjha2327]

Interesting question.

[@chien-yuyeh9386]

Thanks for sharing 🎉

[@shivangikhemka4379]

Hey, How would be solve this to get minimum number of moves if we had more total coins than number of total nodes?
total coins > total nodes
(Extended problem)

[@nikitathacker5096]

How can we conclude that this question doesnt require DP? At first glance, we have choices and we need minimum, making it a good candidate for DP

[@kwakukusi4094]

best explanation

[@pastori2672]

i actually struggled so much on this one and i thought your gonna clown them for the difficulty again but i guess not

[@sankhadip_roy]

extra = left_extra+right_extra+1-node.val # calculated it from the first solution equations
extra = left_extra+right_extra-1+node.val # provided by neetcode
both is working don't know how

[@sivaramakrishnankn1721]

boondhi laddoo gang represent

[@staywithmeforever]

Double bfs?

[@priyanshagarwal8490]

2055. Plates Between Candles... Next Please..🙏

[@kevinwang8632]

this one was hard

[@sajankumarrajbanshi1158]

i love ladoos

[@vijayanks1714]

public int[] dfs(TreeNode root){
if(root == null) return new int[]{0,0}; //size, coins
int[] left = dfs(root.left);
int[] right = dfs(root.right);
int[] curr = new int[]{left[0]+right[0]+1, left[1]+right[1]+root.val};
res += Math.abs(curr[0] - curr[1]);
return curr;
}
java code

[@Masterasadumar]

lol ladu