Range minimum query | 3 methods | Segment tree

[@rohittakalkar9252]

I request you to create a playlist which would contains top 100 interview questions and sort them topic wise and by difficulty internally. Why to purchase AlgoExpert subscription when the expert is right here :-)

[@techdose4u]

Will sort the videos later. First let me create :)

[@sabujjana2860]

no sir. this vid is perfect. now is the time to go for advanced DS.

[@techdose4u]

Covering them along with easier topics to keep a mix so that everyone has something of their need :)

[@ichigokurosaki5707]

@@techdose4u it'll be great if you upload square root decomposition and other various techniques used to solve codeforces problems

[@techdose4u]

Okay sure. I will consider this uploading soon.

[@Suraj6642]

please upload those lectures also of segment tree, where we need to update a complete interval (lazy propagation), at maximum places they ask questions related to lazy propagation only

[@techdose4u]

Sure it will come when I start lazy propagation :)

[@PRANAVMAPPOLI]

Home Work :: So in the update, insted of passing difference in the previous video, we pass the new element as it is and we find all the range having the modified index and check whether the new number is lesser than existing and update accordingly??

[@PRANAVMAPPOLI]

And where ever there is the old number as minimum we also have to change that too,

[@PRANAVMAPPOLI]

Could you please explain the complete flow of update

[@b.sainathreddy4567]

can u please share the code for 2nd method :)

[@techdose4u]

I will share once I resume Segment trees

[@kidsworld2258]

@@techdose4u tqq :)