Distribute Coins in Binary Tree - Leetcode 979 - Python
Vložit
- čas přidán 27. 07. 2024
- 🚀 neetcode.io/ - A better way to prepare for Coding Interviews
🧑💼 LinkedIn: / navdeep-singh-3aaa14161
🐦 Twitter: / neetcode1
⭐ BLIND-75 PLAYLIST: • Two Sum - Leetcode 1 -...
Problem Link: leetcode.com/problems/distrib...
0:00 - Read the problem
0:15 - Drawing Explanation
12:06 - Coding Explanation
leetcode 979
#neetcode #leetcode #python
bro sneaked in `ladoos` and thought we wouldn't notice😂?
Thank you soo much for making these video and soo early as well!!!
Just when I needed the video. Thanks. 😁
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.
Great explanation as always. Thank you
Thanks for sharing 🎉
Tough ques. thanks neetcode
This was great..by 9 minute mark I got an idea and coded it out. it workedd
Interesting question.
i actually struggled so much on this one and i thought your gonna clown them for the difficulty again but i guess not
best explanation
boondhi laddoo gang represent
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)
this one was hard
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
2055. Plates Between Candles... Next Please..🙏
Double bfs?
i love ladoos
I hate leetcode
lol ladu
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
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