Sparse Table | Range Minimum Query in O(1)

  Рет қаралды 6,605

Kartik Arora

Kartik Arora

3 жыл бұрын

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

Пікірлер: 15
@aditya-st1sv
@aditya-st1sv 2 жыл бұрын
in query function it should be:- "min( table[L][power], table[r-(1
@Aks-47
@Aks-47 2 жыл бұрын
"kuch toh baat thi usme, topics bahut aasani se samjha deta ta"
@stunnerhash
@stunnerhash 3 жыл бұрын
mann i just found your channel i just love it brother , keep doing the good work PS: i came here froom your linkedin profile
@ankitpandey3724
@ankitpandey3724 3 жыл бұрын
Was waiting for this one from a long time. Thanks a lot bhaiya🙌🙌🙌🙌
@shubheshtiwari8525
@shubheshtiwari8525 3 жыл бұрын
best explaination.Thnks bhaiya
@elanchezian4452
@elanchezian4452 3 жыл бұрын
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.
@kamalkantrajput7684
@kamalkantrajput7684 3 жыл бұрын
bhaiya writing tool konsa use krte ho ?
@narasimhaswamy5464
@narasimhaswamy5464 2 жыл бұрын
please also make a video on the disjoint sparse table.
@abhijeetbasfore6816
@abhijeetbasfore6816 2 жыл бұрын
Best explanation
@blazemega1567
@blazemega1567 9 ай бұрын
Line 70 is wrong (1
@skt7088
@skt7088 3 жыл бұрын
I have one doubt here, in query function the width should be R-L+1 instead of R-L?
@AlgosWithKartik
@AlgosWithKartik 3 жыл бұрын
Yes right! Thanks for pointing out.
@codingwithanonymous890
@codingwithanonymous890 Жыл бұрын
why R is i+2^j-1 and why not just i+2^j ?
Square Root Decomposition with Code
10:58
Kartik Arora
Рет қаралды 6 М.
Sparse Table & RMQ (Range Minimum Query)
18:42
Errichto Algorithms
Рет қаралды 71 М.
Just try to use a cool gadget 😍
00:33
123 GO! SHORTS
Рет қаралды 33 МЛН
DELETE TOXICITY = 5 LEGENDARY STARR DROPS!
02:20
Brawl Stars
Рет қаралды 15 МЛН
100😭🎉 #thankyou
00:28
はじめしゃちょー(hajime)
Рет қаралды 58 МЛН
Segment Tree Range Minimum Query
27:44
Tushar Roy - Coding Made Simple
Рет қаралды 270 М.
Binary Tree Cameras | Leetcode | DP on Trees
19:37
Kartik Arora
Рет қаралды 11 М.
Sparse Table Data Structure
23:18
WilliamFiset
Рет қаралды 29 М.
CppCon 2014: Mike Acton "Data-Oriented Design and C++"
1:27:46
Sparse Table Algorithm Range Minimum Query
27:33
Tushar Roy - Coding Made Simple
Рет қаралды 57 М.
Mo's Algorithm: DQUERY from SPOJ
19:05
Gaurav Sen
Рет қаралды 41 М.
Machine Code Explained - Computerphile
20:32
Computerphile
Рет қаралды 108 М.
Hash Map | Internal Working and Implementation of Hash Maps
37:09
Sparse Table Tutorial / RMQ
21:05
JAlgs
Рет қаралды 8 М.
Just try to use a cool gadget 😍
00:33
123 GO! SHORTS
Рет қаралды 33 МЛН