arujbansal's blog

[Video Tutorial] Divide and Conquer Dynamic Programming Optimisation
By arujbansal, 23 months ago, In English

Hello!

I posted a tutorial on the Divide and Conquer Dynamic Programming Optimisation on my YouTube channel Algorithms Conquered. I cover the problem Subarray Squares from the CSES Advanced Techniques problem set. Check it out if you're interested!

I also have a tutorial on the Convex Hull Trick dp optimisation (surprisingly the most viewed and longest watched tutorial on my channel) and on other concepts like Persistent Segment Trees, Sparse Tables, Mo's Algorithm and Parallel Binary Search.

  • Vote: I like it
  • +59
  • Vote: I do not like it

»
23 months ago, # |
  Vote: I like it +3 Vote: I do not like it

I very much like your videos. I am recently checking out your subset problem dynamic programming problem N sqrt(N) optimization but it seems very hard. Will take some days before I understand it fully. Genius algorithm it is.

→ Reply