Dynamic Programming, Programming, Algorithms, Data, Coding Interviews.
of optimization problems Longest Increasing subsequence Longest Palindromic Substring Max Product Subarray Maximal square Minimum coin change problem Minimum number of jumps to reach the end 2. Counting Problem In this type of problem, we need to count all occurrences of a typical pattern or