2641. Cousins in Binary Tree II | Leetcode Daily Challenge | DSA | Java | FAANG

Problem Name: 2641. Cousins in Binary Tree II Problem Statement: Given the root of a binary tree, replace the value of each node in the tree with the sum of all its cousins' values. Two nodes of a binary tree are cousins if they have the same depth with different parents. Return the root of the modified tree. Note that the depth of a node is the number of edges in the path from the root node to it. Problem Link: https://leetcode.com/problems/cousins-in-binary-tree-ii/description/?envType=daily-question&envId=2024-10-23 Solution Link: https://github.com/Tiwarishashwat/InterviewCodes/blob/main/CousinsInBinaryTreeII.java Graph Playlist: https://www.youtube.com/playlist?list=PLQ7ZAf76c0ZOGuMjg3qwNgILb_dKWTxyQ Java Plus DSA Placement Course Playlist: https://youtube.com/playlist?list=PLQ7ZAf76c0ZPVdhV1bAjFv0bQc1xHURzE Java Plus DSA Sheet: https://docs.google.com/spreadsheets/d/119u25NO-4ZJ9zwfUKs5eGNo0exCVq3gZEFWvkCDiMqI/edit?usp=sharing Notes: https://github.com/Tiwarishashwat/Java-Plus-DSA-Placement-Course Telegram Link: https://shashwattiwari.page.link/telegramShashwat Ultimate Recursion Series Playlist: https://youtube.com/playlist?list=PLQ7ZAf76c0ZMzC9OHPbo-dUgx6oU3T0jK Instagram Handle: (@shashwat_tiwari_st) https://shashwattiwari.page.link/shashwatInsta Samsung Interview Experience: https://youtu.be/GrvlpBzphSU Company Tags: Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung Timestamp: 0:00 - Introduction #ShashwatTiwari #coding​​ #problemsolving​