Leetcode Problem 2291. Maximum Profit From Trading Stocks

2291. Maximum Profit From Trading Stocks

Leetcode Solutions

Initialize a 1D array dp of length budget + 1 with all elements set to 0.
Iterate over each stock i from 0 to n - 1.
For each stock, iterate over the budget j from budget down to the cost of the current stock present[i].
If buying the stock is profitable (future[i] > present[i]), update dp[j] to be the maximum of dp[j] and dp[j - present[i]] + future[i] - present[i].
After iterating through all stocks, return dp[budget] as the maximum profit.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen