Implemented the Coin Change algorithm in R.

[Sachinn-64]

• Finds the minimum number of coins needed to make a target amount. Uses dynamic programming with both top-down and bottom-up approaches. Handles edge cases including impossible amounts and zero target. Prints DP table, coin combinations, and optimal solutions. Time Complexity: O(amount * num_coins).
• Space Complexity: O(amount) for DP array.

[Copilot]

Pull Request Overview

This PR implements the classic Coin Change algorithm in R using dynamic programming to find the minimum number of coins needed to make a target amount. The implementation includes comprehensive documentation, edge case handling, and example test cases.

• Implements dynamic programming solution with O(amount * num_coins) time complexity
• Includes helper function for visualizing the DP table for educational purposes
• Provides three test cases covering basic usage, impossible amounts, and larger datasets

---

_{Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.}

[Copilot]

Pull Request Overview

Copilot reviewed 1 out of 1 changed files in this pull request and generated 2 comments.

---

_{Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.}

[Sachinn-64]

@siriak

[siriak]

Looks good, thanks!