feat: solve Striver SDE Sheet problem 51 - Combination Sum

Author: TechnoBlogger14o3

striver-sde-sheet/051-39-Combination-Sum/README.md

@@ -0,0 +1,21 @@
+# Combination Sum (Medium)
+
+**Problem ID:** 39  
+**Problem Number:** 51  
+**Link:** https://leetcode.com/problems/combination-sum
+
+## Problem Statement
+
+Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.
+
+The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different.
+
+The test cases are generated such that the number of unique combinations that sum up to target is less than ...
+
+## Solutions
+
+- Python: `solution.py`
+- Java: `solution.java`
+- JavaScript: `solution.js`
+
+**Note:** Solutions need to be implemented.

striver-sde-sheet/051-39-Combination-Sum/solution.java

@@ -0,0 +1,7 @@
+// Solution for Combination Sum
+// Problem ID: 39
+// Link: https://leetcode.com/problems/combination-sum
+
+class Solution {
+    // TODO: Implement solution
+}

striver-sde-sheet/051-39-Combination-Sum/solution.js

@@ -0,0 +1,10 @@
+// Solution for Combination Sum
+// Problem ID: 39
+// Link: https://leetcode.com/problems/combination-sum
+
+/**
+ * TODO: Implement solution
+ */
+var solve = function() {
+    // Implementation needed
+};

striver-sde-sheet/051-39-Combination-Sum/solution.py

@@ -0,0 +1,8 @@
+# Solution for Combination Sum
+# Problem ID: 39
+# Link: https://leetcode.com/problems/combination-sum
+
+class Solution:
+    def solve(self):
+        # TODO: Implement solution
+        pass