Segment Tree | Update Query | Story To Code | Video 2 скачать в хорошем качестве

Segment Tree | Update Query | Story To Code | Video 2

iPad PDF Notes - https://github.com/MAZHARMIK/Intervie... Whatsapp Community Link : https://www.whatsapp.com/channel/0029... This is the 2nd video of our playlist "Segment Tree Concepts & Questions". Find the Details below : Video Name : Segment Tree | Update Query | Story To Code | Video 1 Video # : 2 🔍 Unraveling Segment Tree : A Journey into the Depths of Code 🎥 Welcome to the 2nd Video of my Segment Tree Concepts & Questions Playlist! 🚀 In this enlightening video, we will see how segment trees help to do update query operations efficiently. 🔍 What's Inside ? 🔗 We will see how segment trees help to do update query operations efficiently. 👩‍💻 Who Should Watch ? This playlist is for everyone but best suited for Freshers who are new to Segment Tree. 🚀 Embark on the Segment Tree Adventure Now! My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | Topic...   My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will no m...   My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And Ques...   My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Intervie... Subscribe to my channel :    / @codestorywithmik   Instagram :   / codestorywithmik   Facebook :   / 100090524295846   Twitter :   / cswithmik   Summary : In this video we will see how segment trees help to do update query operations efficiently. We will also see how in the "Range Sum Query" problem, the update query is O(n) and how segment tree helps to reduce this time to O(log(n)). We will understand it from the tree diagram and also convert the story to code to write the updateSegmentTree function. ╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗ ║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣ ╠╗║╚╝║║╠╗║╚╣║║║║║═╣ ╚═╩══╩═╩═╩═╩╝╚╩═╩═╝ ✨ Timelines✨ 00:00 - Introduction 1:11 - Why Prefix array takes O(n) update time 5:34 - Segment Tree comes to action 8:38 - Visualise from Tree Diagram 14:27 - Story To Code 19:54 - Time Complexity O(log(n)) #codestorywithMIK #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 #2024 #newyear #RecursionExplained #CodingJourney #Programming101 #TechTalks #AlgorithmMastery #Recursion #Programming #Algorithm #Code #ComputerScience #SoftwareDevelopment #CodingTips #RecursiveFunctions #TechExplained #ProgrammingConcepts #CodeTutorial #LearnToCode #TechEducation #DeveloperCommunity #RecursiveThinking #ProgrammingLogic #ProblemSolving #AlgorithmDesign #CSEducation #segmenttree #segment #rangequeries