1.Maybe dynamic programming optimizations(knuth and quadrangle inequality).
2.digit dp is also there.
3.parallel binary search(recently saw a question on that around feburay or january challenge).
I will try to write one on that. Thanks for suggesting
Hi. There is already a good tutorial in quora(threads @iiit hyd) by lalit kundu. That’s a very good blog. Still if you want me to make one I can, explaining some other problems and covering up persistent trie.
Yes I read Lalit’s blog during June Long, GeeksForGeeks article is also good.
A tutorial on covering various Persistent data structures would be nice
Okay i will take that up soon .
Okay sure I will make one on that too . Thanks for suggesting
Nice one, keep posting
Thanx…
Hi @vivek_shah98 , I am also new to wordpress. Perhaps if you have an account you can subscribe as I got few mails regarding users following my blog. See if you can find an option
Thanks a lot for your efforts
See I was in your place and I believe I am still in your place. One thing I can tell you that will help, NEVER hesitate to implement something. Like for example I had learnt HLD technique a year back, and its just one or two months before that I implemented it for the first time. Now I feel very confident while coding HLD. Same goes for many advanced techniques like Centroid Decomposition or Persistent DS or Treaps etc. And internet is a vast unlimited resource itself. Also do check my blog regularly, I will try putting up some nice articles soon