Coin change, House Robber

[paridhimalviya]

Problem1 (https://leetcode.com/problems/coin-change/)

Problem2 (https://leetcode.com/problems/house-robber/)

[super30admin]

• The student's solution is thorough and demonstrates a deep understanding of dynamic programming concepts. The inclusion of multiple approaches (recursion, memoization, tabulation) is commendable.
• The comments and explanations are helpful, but some comments could be more concise to improve readability.
• The student could consider adding more test cases to validate the solution further, especially edge cases like empty coin arrays or zero amount.
• The use of Int.max - 10 or Int.max - 3 to avoid overflow is a good practice, but the rationale could be explained briefly in the comments.

[super30admin]

Strengths:

• Comprehensive coverage of different approaches (recursion, memoization, tabulation).
• Good handling of edge cases and base conditions.
• Effective use of optimizations (1D array for tabulation).
• Clear and detailed comments explaining the logic.

Areas for Improvement:

• Variable names could be more descriptive (e.g., case1 and case2 could be notChoose and choose).
• The memoization and tabulation solutions could be separated into distinct files or sections for better organization.
• The house robber problem implementation could benefit from more comments explaining the logic, especially the path tracking part.