Segment Tree | Introduction | Basics | Build Segment Tree | Video 1 | codestorywithMIK

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



Duration: 54:43
9,580 views
433


iPad PDF Notes - https://github.com/MAZHARMIK/Intervie...
Whatsapp Community Link : https://www.whatsapp.com/channel/0029...
This is the 1st video of our playlist "Segment Tree Concepts & Questions". Find the Details below :

Video Name : Segment Tree | Introduction | Basics | Build Segment Tree | Video 1
Video # : 1

🔍 Unraveling Segment Tree : A Journey into the Depths of Code

🎥 Welcome to the 1st Video of my Segment Tree Concepts & Questions Playlist! 🚀 In this enlightening video, we dive headfirst into the world of Segment Tree, demystifying its essence and unraveling its secrets. 🌐

🔍 What's Inside ?

🔗 Definition: Get ready to grasp the fundamental concept of Segment Tree – What is it ? Why do we need it ? How to build it etc.

🚀 Why Segment Tree ? Uncover the beauty and power of segment tre in solving complex problems, making your code more elegant and efficient.

👩‍💻 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 ? | ...  
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/Intervie...
Subscribe to my channel :    / @codestorywithmik  
Instagram :   / codestorywithmik  
Facebook :   / 100090524295846  
Twitter :   / cswithmik  


Summary : In this video, we will see what a segment tree is, why we need it. We will see with a simple example of "Range Sum Query". We will understand the details and
basics of segment tree. Understand with a complete example dry run. Make the tree diagram and deduce the simple recursive code to build a segment tree.

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

✨ Timelines✨
00:00 - Introduction
0:45 - Whe to use Segment Tree
5:35 - How to visualise segment Tree
15:30 - How many nodes in Segment Tree
25:10 - Code for Segment tree from tree diagram
37:46 - Complete Dry Run
49:43 - Time & Space Complexity of Build Segment Tree
52:46 - What’s Next ???


#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




Other Videos By codestorywithMIK


2024-06-23Minimum Number of K Consecutive Bit Flips | 3 Approaches | Detailed | Leetcode 995 | 3191
2024-06-22Segment Tree | Why size is 4*n | With Proof | Video 4
2024-06-21Count Number of Nice Subarrays | 2 Approaches | Similar Concept | Leetcode 1248 | codestorywithMIK
2024-06-21Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Leetcode 1438 |Detailed
2024-06-19Grumpy Bookstore Owner | Simplest Thought Process | Leetcode 1052 | codestorywithMIK
2024-06-18Magnetic Force Between Two Balls | Simple Thought Process | Leetcode 1552 | codestorywithMIK
2024-06-17Segment Tree | Range Sum Query | Story To Code | Video 3
2024-06-17Minimum Number of Days to Make m Bouquets | Simple Thought Process| Leetcode 1482 | codestorywithMIK
2024-06-16Most Profit Assigning Work | Multiple Approaches | With Intuition | Leetcode 826 | codestorywithMIK
2024-06-16Segment Tree | Update Query | Story To Code | Video 2
2024-06-15Segment Tree | Introduction | Basics | Build Segment Tree | Video 1 | codestorywithMIK
2024-06-14Patching Array | Thought Process | Dry Runs | GOOGLE | Leetcode 330 | codestorywithMIK
2024-06-13Minimum Increment to Make Array Unique | Sorting | Counting Sort | Leetcode 945 | codestorywithMIK
2024-06-13IPO | Easy Beginner Friendly | Story To Code | Leetcode 502 | codestorywithMIK
2024-06-12Minimum Number of Moves to Seat Everyone | Counting Sort | Sort | Leetcode 2037 | codestorywithMIK
2024-06-09Relative Sort Array | Counting Sort | Using Lambda | Leetcode 1122 | codestorywithMIK
2024-06-06How codestorywithMIK was started | Motivation | Rejections | 50K Special
2024-06-06Replace Words | Using TRIE | Uber | Leetcode 648 | codestorywithMIK
2024-06-05Replace Words | Using HashSet | Uber | Leetcode 648 | codestorywithMIK
2024-06-04Hand of Straights | Simple Thought Process | Google | Leetcode 846 | codestorywithMIK
2024-06-03Find Common Characters | Simple Dry Run | Leetcode 1002 | codestorywithMIK