Done DP2

[Bhumika-95]

No description provided.

[super30admin]

Strengths:

• The solution correctly implements the dynamic programming approach.
• The time complexity is optimal (O(n)), which is a significant improvement over the reference solution.
• The code is clean, readable, and well-structured.

Areas for Improvement:

• The space complexity can be optimized further. Instead of using a 2D DP table, you can use three variables to keep track of the previous row's costs, reducing the space complexity to O(1).
• Adding comments to explain the logic, especially the DP table initialization and updates, would make the code more understandable for others.