Range minimum query | 3 methods | Segment tree

This video explains a very frequently asked interview question which is the range minimum query. I have solved this problem using 3 methods. The first method is the bruteforce approach, the second one is the efficient approach using arrays and the third approach is the segment tree approach which takes moderate time but is very useful in case your array has frequent updates. Please watch the RANGE SUM QUERY video for a detailed explanation on segment tree with code. Both CODE LINK and RANGE SUM QUERY LINK is present below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[rohittakalkar]

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 :-)

[Suraj]

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

[sabujjana]

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

[b.sainathreddy]

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

[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??