Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
Think of dynamic programming with states to track progress and remaining operations.
Use <code>dp[index][op1][op2]</code> where each state tracks progress at <code>index</code> with <code>op1</code> and <code>op2</code> operations left.
At each state, try applying only operation 1, only operation 2, both in sequence, or skip both to find optimal results.