Implemented the Subset Sum Problem algorithm in R.

[Orthodox-64]

• Determines whether a subset exists that sums to a target value using dynamic programming.
• Efficient O(n*sum) DP implementation with O(sum) space-optimized version.
• Handles edge cases including empty arrays, zero targets, and impossible sums.
• Prints DP table, subset verification, and performance comparisons.
• Time Complexity: O(n * sum) for DP table, O(sum) for optimized version.
• Space Complexity: O(n * sum) for DP table, O(sum) for optimized version.

[Copilot]

Pull Request Overview

This PR implements the Subset Sum Problem algorithm in R using dynamic programming. The implementation determines whether a subset exists that sums to a target value and includes both standard and space-optimized versions.

Key changes:

• Implements basic DP solution with O(n*sum) time and space complexity
• Provides space-optimized version with O(sum) space complexity
• Includes comprehensive testing with edge cases and real-world examples

---

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

[Orthodox-64]

@siriak

[Copilot]

Pull Request Overview

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

[Copilot]

Pull Request Overview

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

[Copilot]

Pull Request Overview

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

[Orthodox-64]

@siriak pls check now

[Copilot]

Pull Request Overview

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

[siriak]

Looks good, thanks!