Paths from root with a specified sum | 🧑‍💻 C++, Java, Python | Binary Tree | Recursion | POTD | GFG

Publicado el: 21 enero 2024
en el canal de: Kattamuri Kowshiq
219
10

♦️ Link to my WhatsApp Channel: https://whatsapp.com/channel/0029VaIT...


🔹Link to the question: https://www.geeksforgeeks.org/problem...

🔸C++ code: https://github.com/AlgoZenithNITC/GFG...
🔸Java code: https://github.com/AlgoZenithNITC/GFG...
🔸Python code: https://github.com/AlgoZenithNITC/GFG...

Hi everyone, welcome to my channel where I upload the video solutions to the "Problem of the day" that is asked daily on GeeksforGeeks. Today's problem is "Paths from Root with a specified sum" which is a medium level question and has been asked by Microsoft.

In this video, I will explain a simple recursive solution to solve this problem which is both time efficient, O(N^2) and space efficient, O(H), where H is the height of the tree.

00:00 Jai Shree Ram
03:30 Introduction to the problem
04:14 Understanding the problem
05:25 Framing the approach to solve the problem
09:44 Going through the code

I hope you enjoyed this video and learned something new. If you did, please give it a thumbs up 👍 and share it with your friends who are also interested in coding. And don't forget to subscribe to my channel and hit the bell icon 🔔 to get notified whenever I upload a new video. Thank you for watching and see you in the next one! 😊

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

#dsa #amazon #paytm #programming #gfg #gfgpotd #problemsolving #coding #softwareengineer #faang #microsoft #competitiveprogramming #dsasheet #interviewpreparation #coding #helpajobseeker #gfg #geeksforgeeks #leetcode #potd #coding #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #india #easyexplaination #interview #interviewtips #interviewpreparation #interview_ds_algo #github #data #google #video #vistu #financial #leetcode #leetcodechallengeeetcodedailychallenge #leetcodesolutions #leetcodequestionandanswers #leetcodequestions #leetcodesolution #leetcodethehardway #substring #dynamicprogramming #strings #c
#java #python #codinginterviews #problemoftheday #countnumbers #homogenous #algorithm #datastructures #english #greedy #spacecomplexity #timecomplexity #goldmansachs #google #linkedin #linkedintutorial #bitmanipulation #bits #competitiveprogramming #apple #lcs #tabulation #bloomberg #microsoft #subsequence #ibm #binarytree #linkedlist #microsoft #zooper #walmart #flipkart #snapdeal #informatica #makemytrip #oyo #paypal #codenation #triology


En esta página del sitio puede ver el video en línea Paths from root with a specified sum | 🧑‍💻 C++, Java, Python | Binary Tree | Recursion | POTD | GFG de Duración hora minuto segunda en buena calidad , que subió el usuario Kattamuri Kowshiq 21 enero 2024, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 219 veces y le gustó 10 a los espectadores. Disfruta viendo!