Easily Solve Range Query Interview Problems with Square Root Decomposition/Mo's Algorithm

In this tutorial, we'll explore the Square Root Decomposition method, a powerful algorithm for tackling range query problems in coding interviews. Join me as we break down the concept and demonstrate its application in solving real-world coding challenges.
Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!
👉 Resources
- Join Replit: join.replit.com/kunal-kushwaha
- Lecture code: replit.com/@KunalsReplit/SQRT...
- Complete Java DSA playlist: • Java + DSA + Interview...
- Code, Assignments, & Notes: github.com/kunal-kushwaha/DSA...
➡️ Connect with me: kunalkushwaha.com
👨‍💻 Join WeMakeDevs: wemakedevs.org
=============================================
Timestamps:
00:00 Theory
28:59 Code
#dsa #placement

[@KunalKushwaha]

👉 Resources - Join Replit: join.replit.com/kunal-kushwaha - Lecture code: replit.com/@KunalsReplit/SQRTDecomposition

[@magicdoor5802]

Bro please give a lecture on dynamic programming and one video on dynamic programming questions that will be best please do it. i know you must be busy but please consider this request .

[@orion3052]

Never seen anyone teaching something wrong with so much confidence xD He genuinely believes what he is teaching is actually MO

[@girishn804]

Thank you Kunal..!! Please try to bring back the OG notepad which you used in the previous videos :)

[@pavan305]

You look so tired brother.. that doesn't seem good have some sleep first 🙌

[@user-jb6ey8wn4i]

Welcome back to india Kunal. Back to old set up looks so satisfying.

[@sasankmathur6736]

We can also use the two pointer method as well better than o(n).

[@NareshNaresh-cl8rn]

Sir i am thankful for dsa playlist please complete the course sir

[@swatisharma3425]

Hello Kunal, can you please make some videos on Dynamic Programming. I have covered mostly DSA topics through your DSA Bootcamp and it is very easy to understand any topic from your videos.So it's my request to you please also make some videos on DP.It is the most important topic . I have looked for other resources also but it didn't help me out. You cover important topics very effectively. So please make videos on DP as soon as possible

[@jk-sm6qr]

Thank you kunal Need videos on DP and graphs

[@simahalder9493]

Thank you so much bhaiya❤

[@santoshis2568]

Hi Kunal, there is no easy resources for sliding window problems. Can you make some preliminary videos for them? Thanks

[@sourabhkumar5815]

Try Aditya verma's sliding window playlist. He has spoon-fed the concepts.

[@AbhishekPandey-cz5kw]

Bhai , Please suggest any full Java Web Development paid/unpaid courses@@sourabhkumar5815

[@MonuKumar-pe7oq]

Thank you @kunal bro..

[@rahull1321]

Hey Kunal u haven't taught prims and dijkstra's algorithm

[@AbhiishekKumar21]

Please upload more and more video on DSA

[@upsidedown6204]

Thank you bhaiya 😊

[@Muigoku49]

Kunal please start graphs and dp

[@chikuu6770]

Great video

[@user-ld9qj3il7p]

Please do videos on graphs and dynamic programming. We are eagerly waiting🥺

[@upsidedown6204]

Cool 😎👍

[@muhafizraza755]

But if we look at the time to create the BLOCK[ ] array, it's still O(n). Then how the overall time complexity will be SQRT(n) ?

[@d4devotion]

Yes even I think so, because even during that preprocessing we have to divide and add numbers, so not sure how is this really gonna reduce to O(square root of N)

[@arvindkr8966]

coz building the block array always O(n). its the query and update that takes √n.

[@arvindkr8966]

the aim is to reduce the time complexity of the Query

[@sarfrasahamed3322]

Complete the DSA bootcamp soon

[@subasm2160]

There is a bug in this code it gives out of bound exception for array size like 7,8 and 13,14,15 . The reason is sqrt of (8 and 7) is 2 and we are creating block array of size 2+1 = 3 so it can only store 3*2=6 elements but when the array size is 7 or 8 it gives ArrayIndexOutOfBoundsException and the same goes for 13,14 and 15

[@kinandm5301]

int[] blocks = new int[(n/sqrt)+1]; try this

[@rohit8hjj]

Any idea of how much time is required to complete the course?

[@KaizokuOuNaruto]

LOL.. He is giving it for free so you don't have any right to ask about this Stfu and get lost

[@darkKingGaming493]

3,4 months

[@HeyMr.OO7]

December 2023 he replied to my comment earlier in binary search video

[@deepanshugarg4446]

Can you make podcast on flutter

[@aravindr9109]

yeah I would like to hear that

[@dark_techyy]

Dynamic Programming kb aarhi h?

[@abhishekc3556]

Jab wo khud seekhlega toh le aaega

[@Stefan_2117]

😂​@@abhishekc3556

[@kaustubhgaikwad2562]

To reach candidate master is java helpful?

[@i_am_wiz]

You can be Grandmaster using Java, language never mattered, it’s just some incovenience you’ll have to face because of its sluggishness

[@user-dt6mx2fw5p]

This is square root decomposition, not mo's algorithm

[@vakeelsaab5323]

TQ Kunal

[@achintya-7]

Finally

[@arvindkr8966]

the size of the BLOCK array should be (√n +2) instead of (√n+1) as far as Integers are concerned. for the following numbers we will get IndexOu of Bound error if we go with (√n+1) blocks n = 3 8 15 24 35 48 63 80 99 120 143 168 255 288 360 1023 1088 and so on.

[@pratyushpahari2606]

Hope this course will be finished before the year ends 🥹