Completed DP-1 House Robber and Coin Chnage

[joshiatharv1]

No description provided.

[super30admin]

• Strengths:

  • The student has a good understanding of dynamic programming and has applied it correctly to solve both problems.
  • The code is well-commented and easy to follow.
  • The student has considered edge cases and handled them appropriately.
  • The time and space complexity are optimal for both problems.

• Areas for Improvement:

  • For Problem1.java, the initial check for amount < 1 could be more explicitly written as amount == 0 since the problem states 0 <= amount. This would make the intention clearer.
  • In Problem2.java, the comment "O(Dp Array)" for space complexity could be more precise, such as "O(N) for the DP array."