Query Sum II | Segment Tree Concepts & Qns | Video 5 | codestorywithMIK

iPad PDF Notes - github.com/MAZHARMIK/Intervie...
Whatsapp Community Link : www.whatsapp.com/channel/0029...
This is the 5th video of our playlist "Segment Tree Concepts & Questions". Find the Details below :
Video Name : Query Sum II | Segment Tree Concepts & Qns | Video 5
Video # : 5
🔍 Unraveling Segment Tree : A Journey into the Depths of it.
🎥 Welcome to the 5th Video of my Segment Tree Concepts & Questions Playlist! 🚀 In this enlightening video, we will finally start solving Qns on Segment Tree. In this one, we will solve - Query Sum II | Segment Tree Concepts & Qns | Video 5 | codestorywithMIK
🔍 What's Inside ?
🔗 We will see how we can use Segment Tree concepts to easily solve this problem - Query Sum II.
👩‍💻 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!
Problem Name : Query Sum II | Segment Tree Concepts & Qns | Video 5 | codestorywithMIK Company Tags : Amazon My solutions on Github(C++ & JAVA) : github.com/MAZHARMIK/Intervie... Leetcode Link : www.geeksforgeeks.org/problem...
My DP Concepts Playlist : • Roadmap for DP | How t...
My Graph Concepts Playlist : • Graph Concepts & Qns -...
My Recursion Concepts Playlist : • Introduction | Recursi...
My GitHub Repo for interview preparation : github.com/MAZHARMIK/Intervie...
Subscribe to my channel : / @codestorywithmik
Instagram : / codestorywithmik
Facebook : / 100090524295846
Twitter : / cswithmik
Summary : In this video, We see how we can use Segment Tree concepts to easily solve this problem - Query Sum II. This code implements a segment tree data structure to efficiently compute range sum queries on an array. The buildSegmentTree function constructs the segment tree recursively from the input array, where each node stores the sum of a segment of the array. The querySegmentTree function performs range sum queries on the segment tree. The querySum function initializes the segment tree and iterates through a list of queries to compute and return the sum for specified ranges in the array. Overall, this approach ensures that both construction of the segment tree and querying for sums are handled efficiently with O(logn) time complexity per query after an O(n) initial setup time, making it suitable for scenarios requiring frequent range sum computations on static arrays.
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ Timelines✨
00:00 - Introduction
00:12 - Motivation
01:23 - Problem Explanation
03:34 - How to Solve using Segment Tree
11:48 - Coding it up
#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

[@gui-codes]

KOTA FACTORY JEETU BHAIYA = MIK BHAIYA IN DSA INDUSTRY❤

[@priyanshkumariitd]

Thank you Sir

[@user-ub2is4rs4x]

Thank you for continuing this playlist 😢

[@manimanohar_001]

Bro bit manipulation playlist pls 😊

[@user-xw6ns6ih5f]

Bach to back stories❤

[@tarunpatel1457]

❤❤

[@abhinavnarula7300]

i am getting a tle in python if i am using segment tree. Can someone help?

[@simardeepsinghmudhar7065]

If possible please also cover range update (lazy propagation)

[@dayashankarlakhotia4943]

ListquerySum(int n,int arr[],int q,int queries[]){
int[]prefix =new int[n];
prefix[0]=arr[0];
for(int i=1;i

[@aryandumyan1195]

gpt krle