Done DP-1

[Sreeja-99]

No description provided.

[super30admin]

Strengths:

• The student demonstrates a strong understanding of different approaches (recursion, memoization, DP) and their trade-offs.
• The code is well-commented and easy to follow.
• The student considers edge cases and optimizes space complexity where possible.

Areas for Improvement:

• For Leetcode_322, the memoization solution (Way4) could be further optimized by initializing the memo array with -1 or another sentinel value to avoid confusion with 0.
• The student could add more comments explaining the transition from recursion to DP for better clarity.
• In the DP solution for Leetcode_322 (Way3), the inner loop could be optimized to start from coins[i-1] instead of 0, as values below coins[i-1] don't change.