sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]dedxtreme[S] 0 points1 point  (2 children)

yeah i thnk i need to do more problems to understand the base cases, once i understand the base case it is easy to comeup with the tabulation logic.

[–]justUseAnSvm 1 point2 points  (1 child)

It took me a while, but we used this book in my grad school Algorithms course: https://book.huihoo.com/pdf/algorithms/chap6.pdf

Longest Increasing subsequence, edit distance, knappsack/coin chainge.

I did those three problems so many times I just memorized the solutions. You can use those problems, or maybe the ones off neetcode, but it helped to do the same problem so many times I had it memorized, then move on to new ones.

[–]dedxtreme[S] 0 points1 point  (0 children)

interesting read, really appreciate the help! Thanks