Welcome Back Reader!

We hope that you are doing great with Dynamic Programming so far. In this article we will discuss about the next problem based on

**"Dynamic Programming" i.e. "Maximum Sum Increasing Subsequence".
**

We suggest you go through the problem link first, to get an outline of the question.

**Important Links :** Problem Link, Question Video , Solution Video

Before you move any further, it is advised that you give this problem a fair try.

Let's jump to the problem.