Great article! Completely agree with your points. One question- sometimes identifying the pattern can be difficult because one problem can have many patterns, and sometimes problems are tricky, so how do you get around that?
Love your work and hope to see more from you soon :)
As an example a lot of the subarray problems with prefix sum based solution also seem like a sliding window type problem. Any tips on differentiating those?
Great Stuff for revision, Can you Please Add more on DP section and Graph section .
sure, will do.
https://blog.algomaster.io/p/15-leetcode-patterns#:~:text=33-,20%20Patterns%20to%20Master%20Dynamic%20Programming,-%23%2023%20%2D%20Dynamic%20Programming
This post is just pure gold. It has been really helpful. I'm doing all the exercises you listed, Im in Point 11 now, good progress
Awesome for quick refresh
For Prefix sum we need one check as if i=0 then prefix sum is array[j]
agree.. that's an edge case we need to handle. Thanks for pointing it out.
Thank you, this helped a lot. Specially for someone not from CS background!
Thanks for Sharing. Awesome
Great information, it is really helpful, i have good experience into the algorithums, but looking at the these verity of problems really impressive.
I just wanted to say *thank you* for the link to this in the Medium version of the article.
precious content
Thanks for sharing this valuable patterns sir .
awesome ! Have watched your youtube videos too ! Great work
Thanks a lot for sharing the pattern aspect to solve the problems..
you are welcome!
Great article! Completely agree with your points. One question- sometimes identifying the pattern can be difficult because one problem can have many patterns, and sometimes problems are tricky, so how do you get around that?
Love your work and hope to see more from you soon :)
It takes some practice to be able to identify the right pattern for the problem at hand.
For tricky problem, it might be a good idea to brainstorm multiple patterns and see which one fits.
As an example a lot of the subarray problems with prefix sum based solution also seem like a sliding window type problem. Any tips on differentiating those?
So awesome resource for Leetcode, thanks for sharing!
thank you so much!
Well drafted.
thank you!
Great article, thanks. I might be wrong or may have misunderstood but I think there is an inconsistency in your examples:
In the example of the 5th concept, you have used a base 1 indexer, whereas in the others you have used a base 0 indexer
Yes, I found this too. Not many languages use 1 based index these days.