{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/c17cd6b7d58a47f38995aa371c6b6c10\" frameborder=\"0\" width=\"1920\" height=\"1440\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":1440,"width":1920,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":1440,"thumbnail_width":1920,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/c17cd6b7d58a47f38995aa371c6b6c10-00001.gif","duration":112.203,"title":"Understanding Maximum Sum Path in Binary Trees","description":"In this video, I explain how to solve the problem of finding the maximum sum path in binary trees. I discuss the steps involved, including finding the left and right maximum sums, considering positive and negative paths, and returning the maximum sum with the root. I also highlight the importance of not including negative paths in the maximum sum. This video provides a clear explanation of the concept and offers a practical approach to solving the problem. No action is requested from the viewers."}