Range Maximum Index Query | Part 1 | Segment Tree Concepts & Qns | Video 9 | codestorywithMIK

[@noneed6560]

Bhiya, u don’t need to give motivation, you are a motivation

[@user13443fg]

Very well, learned and understood🙌

[@newglobal2056]

Man on 🔥🔥🔥🔥

[@aws_handles]

Man o man. I was about to sleep and saw this legend uploaded a video 🔥🔥🔥 hats off sir. Take some rest also

[@universalcosmologist3675]

Bhai tu insaan nahi insane hai 😂

[@unknown47896]

bro😂😂

[@TUSHARKHANDELWAL-i8s]

nice

[@cabbi9]

2:30 baje video upload 🙌

[@jaisomnath1283]

Bhaiya you are amazing 🤩 Please make a similar playlist for Fenwick tree and sparse table also

[@ronakkriplani1838]

Sahii

[@harshitmaurya1909]

please continue the dp on grids series bhaiya🙃🙃

[@codingwithvikas7484]

Itne raat m bhaiya 😢

[@gui-codes]

Damn 😮😮😮. Sir , take some rest also . Mujhe itni dedication chaie yaar,

[@ronakkriplani1838]

Tum mai hai tabhi tum abhi tak soye nhi aur paadh rahe ho

[@gui-codes]

@@ronakkriplani1838 Thanks bhai. Trying hard, mujhe Product based me switch karna hai. Thoda average hu abhi DSA me kaafi time lag raha hai but I will do it.

[@ronakkriplani1838]

@@gui-codes you are in which year?

[@kalpeshdesai1595]

It's 2.30 AM !!!!! 🫡👏

[@shanmukhtejareddy371]

Are u for real man??? GO have some sleep bhai. U can work on this tomorrow

[@jeevan-23]

❤

[@abodh7046]

bhaiya i have a doubt , if i store the max index the build segment tree, then why we check again in the query segment tree for finding the maximum index this statement if(arr[leftIdx]>=arr[rightIdx]){ return leftIdx } else{ return rightIdx }

[@codestorywithMIK]

Because you have to compare the result from left and right recursive call. Ultimately you have to find the max of all right. So, compare the max from left and right and then ultimately the max will be the maximum from both of them. This is same as Range Maximum/Minumum query (only difference is that we are storing index instead of element)

[@dibbodas4116]

take rest sir

[@92mohitsharma]

can we have 3 more playlist based on severity 1. Leetcode Easy 2. Leetcode Medium 3. Leetcode Hard Not necessary to make new videos for them.

[@higuys450]

Bro when you sleep 😴😴

[@ShivamSharma-vf4uf]

SIR PLEASE SOLVE 21 DEC AND 22 DEC Problem of the day as you skipped these problems on that day @codestorywithMIK

[@gui-codes]

yes please