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

iPad PDF Notes - github.com/MAZHARMIK/Intervie...
Whatsapp Community Link : 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 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 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

[@mukulverma9238]

So excited to conquer this data structure as well! 🎉

[@22gauravkumar70]

Maza aagya bhaiya , You are the best , please segment tree pura daal dijiye jldi

[@gui-codes]

festival k din bhi time nikal rahe ho bhai video k lie. hats off to you.

[@anushasingh5562]

hats off to your explanation
You make each and every topics a piece a cake

[@chitranshjain9714]

amazing
please complete dp concept playlist

[@manishkumarprajapati6280]

awesome yaar. This playlist is a blessing 😇😇 Please keep constructing this playlist.
#NeverBackDownNeverGiveUp

[@priyanshkumariitd]

Hats of to your consistency bhaiya !!

[@lostcyrus8578]

I was waiting for the part 2. Understood the whole concept . Need more such videos please❤❤

[@pankajkashyap2892]

waiting for remaining lectures to come as soon as possible❤❤

[@mbm.editzz]

thank you

[@anuppatankar4294]

Great video 👍🏻

[@aws_handles]

Is consistency ko salute hai yaar 🫡
Har din video bana and that too good is not an easy task

[@_say__my_name03]

Man you are the best teacher on .You can understand anyone and the way of teaching is superb top notch...

[@dayashankarlakhotia4943]

Well explained understood 👏 🎉

[@anjanasahay2172]

Post daily ❤❤

[@riturajprasad3060]

completed this also....next lecture sir....thankyou soo much...

[@satendra6200]

Please try to upload each contest solution this will be more helpful for us

[@user-ub2is4rs4x]

Crystal clear ❤

[@venkatarohitpotnuru38]

Bhaiya please continue dp concept playlist

[@shabananoor9423]

❤❤

[@ugcwithaddi]

Thanks a lot

[@abhinavnarang4369]

bhai live coding kyu nhi krte that was the best part? do that also , btw as always content is very good

[@tanishchordia4813]

Mik just a small request from my side, Please Complete the Dp concepts and Questions vaala playlist as soon as possible.

[@insidious_681]

❤

[@anjumarakhan8647]

Hello mazhar bhai

[@user-is6pf9gh2r]

mik bhaiya make questions like sort till a given index

[@Sumit-wy4zp]

please upload new video ... questions practice 🤩🤩🤩🤩

[@pokeindia5361]

Bhaiya please *longest valid parantheses* Q bataiye please

[@Ayush_mehra07]

Please solve question also for this topic

[@bccjadademicsworld4683]

Early waiting for 3rd video, kab aa rh hai

[@abhisheknegi9448]

Bro will you explain leetcode's latest weekly contest Q3 and 4?

[@mbm.editzz]

3rd part kb ayga sir?

[@22gauravkumar70]

bhaiya segment tree ka next video daal do raha nhi jaa raha

[@salmanrayeen8693]

Aaj 17 Jun ka daily challenge nahi aya aaj ?

[@gui-codes]

channel me jakar community section me click karo, waha dala hai aaj k POTD ka post

[@Stressful_Jindagi]

void build(int ind,int low,int high, int arr[], int seg[]){
if(low==high){
seg[ind]=arr[low];
return;
}
int mid=(low+high)/2;
build(2*ind+1,low,mid,arr,seg);
build(2*ind+2,mid+1,high,arr,seg);
seg[ind]=min(seg[2*ind+1],seg[2*ind+2]);
}
int query(int ind,int low,int high, int l, int r, int seg[]){
//no overlap
// [l,r] [low,high] || [low,high] [l,r]
if(r

[@sahilanand30]

❤