Here, we are given an input n representing the numbers of days and we are given n values representing the price of stocks on each day. We are also given k which represents the number of transactions allowed. We have to find the maximum profit that can be made in n days with k transactions allowed. Also, there is a condition that there should not be any overlapping transactions. This means that we can not buy another stock before selling the previous one.
You may refer to the BUY AND SELL STOCKS WITH K TRANSACTIONS video to understand the question clearly if you have any doubts regarding it. We recommend you solve the question on your own first. We also recommend you to watch the solution video even if you have solved the problem as it will give you a lot of insight into the question.