Sparse Table | Range Minimum Query in O(1)
Vložit
- čas přidán 3. 04. 2021
- Introduction to Sparse Table.
Solve Range Min Queries in O(1) time.
Super useful books for algo ds and programming fundamentals!
1. Introduction to Algorithms by Cormen: amzn.to/35AmQqu
2. The Algorithm Design Manual: amzn.to/2K9RGPq
3. Fundamentals of Data Structures in C++: amzn.to/2LCwIsN
4. Object-Oriented Programming by E Balagurusamy: amzn.to/2Xxmdtr
5. Head First Java: amzn.to/39kb44K
6. Cracking the coding interview: amzn.to/3iDOHLK
7. Database System concepts: amzn.to/3pisuFQ
8. Operating Systems: amzn.to/39fcmis
9. Discrete Mathematics: amzn.to/2MlgCE6
10. Compiler Design: amzn.to/3pkYvx2
in query function it should be:- "min( table[L][power], table[r-(1
"kuch toh baat thi usme, topics bahut aasani se samjha deta ta"
Was waiting for this one from a long time. Thanks a lot bhaiya🙌🙌🙌🙌
bhaiya writing tool konsa use krte ho ?
mann i just found your channel i just love it brother , keep doing the good work
PS: i came here froom your linkedin profile
best explaination.Thnks bhaiya
hi
I am working now in a small company where I don't find any experience which would be good for my long term/future career.
I recently started programming like logical questions and data structure questions. I am able to solve the basic problems and around most of the medium problems with more time to think that the basic problems.
Some times what happens is some problems are taking so so much time to think, if I am lucky I will get the logic by my own or I don't.
I have a question here. What should I do now if I don't get the solution? Whether I can see the solution or I should think and get the solution by my own only?
What I do is if I dint get solution I may leave that question or keep on thinking on that solution and after some time I forget that I was doing this question and jump to other.
Is it good to see the solution if I dint get the logic?
Please give your suggestions.
please also make a video on the disjoint sparse table.
Best explanation
Line 70 is wrong (1
I have one doubt here, in query function the width should be R-L+1 instead of R-L?
Yes right! Thanks for pointing out.
why R is i+2^j-1 and why not just i+2^j ?