Completed DP-2 problems

[Nikesh46]

No description provided.

[super30admin]

• Strengths:
  • The student has demonstrated a strong understanding of dynamic programming and has implemented efficient solutions.
  • The code is clean, well-commented, and easy to follow.
  • The student has explored multiple approaches (commented out) and chosen the most efficient ones.
• Areas for Improvement:
  • In the minCost problem, the student could consider adding comments to explain the logic behind the 1D DP approach for better clarity.
  • In the change problem, the student could add a brief explanation of why the 1D DP approach works, especially the part where dp[j] = dp[j - coins[i - 1]] + dp[j].