Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK

Subscribers:
92,300
Published on ● Video Link: https://www.youtube.com/watch?v=UIrargaZ61M



Duration: 0:00
7,806 views
406


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 50th Video of our Playlist "Binary Tree : Popular Interview Problems" by codestorywithMIK

In this video we will try to solve a good Binary Tree Problem : Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK

I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.

Problem Name : Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK
Company Tags : will update
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Cousins in Binary Tree II.cpp
Leetcode Link : https://leetcode.com/problems/cousins-in-binary-tree-ii/description


My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And...  
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel :    / @codestorywithmik  

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

Summary :
Approach 1 (First Code):

Goal: Replace each node's value with the sum of all cousin nodes.
Steps:
Traverse the tree level by level using a queue (BFS).
Calculate the sum of node values at each level and store it in a levelSum list.
For each node at a given level, update its value to be the difference between the sum of the current level and the sum of its sibling nodes.
Update the node values and move to the next level.
Efficiency: This approach computes the sum of node values for each level before updating the node values. It requires an additional array (levelSum) to store sums for each level.
Approach 2 (Second Code):

Goal: Replace each node's value directly with the sum of its sibling nodes.
Steps:
Traverse the tree level by level using a queue (BFS).
For each node, subtract its current value from the total sum of the current level (levelSum), and update its value.
Calculate the sibling sum for each node's children and store it in those nodes.
Compute the sum of the next level's values (nextLevelSum) while processing the current level, then update levelSum to nextLevelSum for the next iteration.
Efficiency: This approach updates the node values directly while traversing the tree, without needing an additional array for storing level sums. It updates the node values on-the-fly, making it slightly more space-efficient than the first approach.

✨ Timelines✨
00:00 - Introduction

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik




Other Videos By codestorywithMIK


2024-10-30Delete Characters to Make Fancy String | Simple & Easy | Leetcode 1957 | codestorywithMIK
2024-10-28Minimum Number of Removals to Make Mountain Array | Thought Process | Leetcode 1671|codestorywithMIK
2024-10-28Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK
2024-10-27DSA Shorts with MIK - 7
2024-10-26Longest Square Streak in an Array | Detailed Approaches | Dry Run | Leetcode 2501 | codestorywithMIK
2024-10-25Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK
2024-10-24Maximum Width Ramp | How to identify Monotonic Stack | Dry Runs | Leetcode 962 | codestorywithMIK
2024-10-24Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK
2024-10-23Remove Sub-Folders from the Filesystem | 2 Simple Approaches | Leetcode 1233 | codestorywithMIK
2024-10-22Flip Equivalent Binary Trees | Simple Recursion | Dry Run | Leetcode 951 | codestorywithMIK
2024-10-21Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK
2024-10-20Parsing A Boolean Expression | Cleanest Explanation | Dry Run | Leetcode 1106 | codestorywithMIK
2024-10-19Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593
2024-10-19Find Kth Bit in Nth Binary String | Detailed Recursion | Dry Run | Leetcode 1545 | codestorywithMIK
2024-10-17Count Number of Maximum Bitwise-OR Subsets | Simplest Approach |Leetcode 2044 | codestorywithMIK
2024-10-17Maximum Swap | 2 Simple Approaches | Leetcode 670 | codestorywithMIK
2024-10-15Longest Happy String | Simple Thought Process | Leetcode 1405 | codestorywithMIK
2024-10-14Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK
2024-10-13Maximal Score After Applying K Operations | Standard Heap Problem | Leetcode 2530 | codestorywithMIK
2024-10-13Smallest Range Covering Elements from K Lists | Multiple Ways | Leetcode 632 | codestorywithMIK
2024-10-11Divide Intervals Into Minimum Number of Groups | Simple Intuition | Leetcode 2406 | codestorywithMIK