You should maybe stop asking for likes and shares. No one in their good sense will dislike this video. You truly understand the various phases of the algorithm one finds difficulty grasping and try to cover them in meticulous and illustrative examples. You deserve an award for being only one of the kind of KZfaq Channel that has a whole lot of algorithm explanation. Awesome Sir!

114k subscribers are very less for u.I haven't seen ny video with this level of explanation.superb xplanation

Just wanted to say thank you for all the work you've put into these videos and explanations. Your work has helped me immensely and I really appreciate it.

khatarnak tarike se dhulai karte hai aap algorithms ki...use chupne ki jagah nahi milti.... u r great sir ji

Great Explanation! Your videos are helping dev community a lot.

thanks for the videos... they were really helpful ... just know that because of you many students didn't got supply in algorithm course

Thank you sir! I would have given up on the problem without this video.

Thanks for the explanation Tushar!

Thanks sir for your great effort... very simple and easy explanation.

That was very good explanation , cleared some of my doubts ! Thanks Tushar Sir :)

Wow , such a clean explanation , Thank You 💙

I love this, great work sir

Awesome video Tushar sir

This video is really useful, thank you very much, some people mistakenly thought the dislike button was a download button :D

Superbly Amazing! Thanks mate :)

Thank you so much! always the best!!!!

sweet and simple explanation , keep it up :D

Thanks bhai, finally understood how it works. :D

Thank you. Very nice explanation.

Hi Tushar. If we were to do point updates at an index, then we would update all those entries at which the index in picture might contribute as a minimum to, right? This would be O(N logN) for N such point update queries. Am I correct in saying this?

Best explanation !

thanks for the explanation.

Great one!

Thank you so much sir.

great as usual :D

great video sir :)

Thanks a lot :D could you please add one of LCA By RMQ also.

can we use sparse table for max min range query in a 2d array(matrix)?

Weldone bruh Thanks

while doing the range query, why are we moving by k after we find the min in [query_L, K]? Since, we have already calculated for 2^k number of elements?

Thank you!

many thanks!

Thank you bro!

for range queries problems. which algorithm would be better?

good explanation

Correct me If I'm wrong according to the sparse table being taught when i=4, j=0 in the first column, j will be 6 and i will be 7 and the min of both is 6 so the index of the 6 which is 1 should be returned right?

thank you very much

Explanation of pseudo code at the end is what i love most in your videos.. literally it saved hours of my effort for understanding how this algos work.. and all these bcz u put days of effort into building this awesome videos. Such clean and clear explanations with examples. Thank you sooo much!! Hats off to you. Please keep uploading more. Also if possible put links to some problems related to this algos to practise. Thanks once again!

thanks a lot sir :)

Hi Tushar. Thank you for your video. I think for your viewers would be useful to explain the main idea of the algorithm with a sparse table. And this is as following: any range-interval [u,v] to divide onto two intersecting intervals [u,u+2^k-1] and [v+1-2^k,v] of length 2^k these two intervals are intersecting because by choice: 2^k

Hi tushar! what is the logic behind putting index of minimum numbers in table , you could have directly put the minimum value direct in the table. BTW nice video as always.

thanku sir

good

respect++

can you upload some questions related to it

Nice explanation. But Plz use another marker

cout

is this MO's algo ??

does anyone know which problem in leetcode this is ?

wanted to give a double like to the video. but alas youtube restricted me two just one like.

Important point : if we have to find out sum of elements in range [L, R], then sparse table will give time complexity O(log N) not O(1)

Is it only me who listen keyboard smashing sound when he write something on board

number of columns should be floor(log2(n))

Wouldn't it be more helpful if we store the elements directly..rather than their index

The time complexity to query RMQ Sparse Table in your implementation is log*(n) (not to be confused with log(n), log*(n) is iterated logarithm) which can be reduced to O(1) by choosing 2 [L,R] values such that they cover all the nodes. Read this for more www.topcoder.com/community/data-science/data-science-tutorials/range-minimum-query-and-lowest-common-ancestor/#Lowest%20Common%20Ancestor%20(LCA)

Hi tushar, I think Segment tree takes O(n log(n)) space and time for pre processing. Not O(N)

G 17:23

Tushar bhai angrejo ki tarah English kyun bol rhe ho.....indian style English bol lo

first of all you should explain the logic or why we are doing something