Patterns for Dynamic Programming:
0/1 Knapsack
Unbounded Knapsack
Fibonacci Numbers
Longest Palindromic Subsequence
Longest Common Subsequence
Min/Max Path Sum
Dynamic Programming on Strings
top of page
Recent Posts
See AllSteps to master a topic: Study and understand all concepts related to the topic Solve Easy level questions from the topic Solve Medium...
90
Yes! There are three ways which pay same and in some cases even more than FAANG companies and !! Remote roles —> Try getting developer...
140
Leetcode and geeksforgeeks ! Other platforms which are good as well: hackerank hackerearth . Hackerrank is best site if you are new to...
110
bottom of page
Comments