Added More Solutions

Author: HxnDev

Combination of K numbers out of range [1,n]/Readme.md

@@ -0,0 +1,24 @@
+class Solution {
+    public:
+        vector<vector<int>> combine(int n, int k){
+            vector<vector<int>> output;
+            vector <int> combination;
+            combine(output, combination, n, k, 1);
+            return output;
+        }
+
+    private:
+
+        void combine(vector<vector<int>> & output, vector<int> combination, int n, int k, int i){
+            if (combination.size() == k){
+                output.push_back(combination);
+                return;
+            }
+
+            for (int j=i; j<=n; j++){
+                combination.push_back(j);
+                combine(output, combination, n, k, j+1);
+                combination.pop_back();
+            }
+        }
+};

Combination of K numbers out of range [1,n]/main.cpp

@@ -0,0 +1,22 @@
+class Solution:
+    def consecutiveNumbersSum(self, n: int) -> int:
+
+        if n == 1:
+            return 1
+
+        res = 1
+
+        for i in range(2, int(n**0.5 + 1)):
+            if n % i == 0:
+                if i % 2 == 1:
+                    res += 1
+
+                j = (n // i)
+
+                if i != j and j % 2 == 1:
+                    res += 1
+        
+        if n % 2 == 1:
+            res +=1
+
+        return res

Consecutive Number Sum/Readme.md

@@ -0,0 +1,16 @@
+class Solution {
+    public List <Integer> findDuplicates(int[] nums){
+        List <Integer> result = new ArrayList<>();
+
+        for (int i=0; i<nums.length; i++){
+            int index = Math.abs(nums[i] - 1);
+
+            if (nums[index] < 0)
+            {
+                result.add(index+1);
+            }
+            nums[index] = nums[index] * -1;
+        }
+        return result;
+    }
+}