Sure, here is a Python solution for the problem:

```python
def combinationSum(arr, n, k):
arr.sort()
temp = []
result = []
unique = []
total, j = 0, 0
findNumbers(arr, n, k, temp, total, j, result, unique)
return unique

def findNumbers(arr, n, k, temp, total, j, result, unique):
if total == k:
if sorted(temp) not in result:
result.append(sorted(temp))
unique.append(temp[:])
return
for i in range(j, n):
if (total + arr[i])

Question

Sure, here is a Python solution for the problem:

```python
def combinationSum(arr, n, k):
    arr.sort()
    temp = []
    result = []
    unique = []
    total, j = 0, 0
    findNumbers(arr, n, k, temp, total, j, result, unique)
    return unique

def findNumbers(arr, n, k, temp, total, j, result, unique):
    if total == k:
        if sorted(temp) not in result:
            result.append(sorted(temp))
            unique.append(temp[:])
        return
    for i in range(j, n):
        if (total + arr[i]) <= k:
            temp.append(arr[i])
            total += arr[i]
            findNumbers(arr, n, k, temp, total, i+1, result, unique)
            total -= temp.pop()

# Test the function
n = 5
k = 7
arr = [1, 2, 3, 3, 5]
print(combinationSum(arr, n, k))
```

This Python code defines a function `combinationSum` that sorts the input array and initializes some variables. It then calls the helper function `findNumbers` to find all combinations of numbers that add up to `k`. The helper function uses a recursive approach to find all combinations. If the current total equals `k`, it checks if the combination is unique and if so, adds it to the result. If the total is less than `k`, it continues to add the next number in the array to the total and calls itself with the updated total and array index. After each recursive call, it removes the last number added to the total to backtrack and find other combinations. The function finally returns all unique combinations.

Knowee AI · Accepted Answer

Sure, here is a Python solution for the problem:

```python
def combinationSum(arr, n, k):
    arr.sort()
    temp = []
    result = []
    unique = []
    total, j = 0, 0
    findNumbers(arr, n, k, temp, total, j, result, unique)
    return unique

def findNumbers(arr, n, k, temp, total, j, result, unique):
    if total == k:
        if sorted(temp) not in result:
            result.append(sorted(temp))
            unique.append(temp[:])
        return
    for i in range(j, n):
        if (total + arr[i]) <= k:
            temp.append(arr[i])
            total += arr[i]
            findNumbers(arr, n, k, temp, total, i+1, result, unique)
            total -= temp.pop()

# Test the function
n = 5
k = 7
arr = [1, 2, 3, 3, 5]
print(combinationSum(arr, n, k))
```

This Python code defines a function `combinationSum` that sorts the input array and initializes some variables. It then calls the helper function `findNumbers` to find all combinations of numbers that add up to `k`. The helper function uses a recursive approach to find all combinations. If the current total equals `k`, it checks if the combination is unique and if so, adds it to the result. If the total is less than `k`, it continues to add the next number in the array to the total and calls itself with the updated total and array index. After each recursive call, it removes the last number added to the total to backtrack and find other combinations. The function finally returns all unique combinations.

Question

Solution

Similar Questions

Upgrade your grade with Knowee