Question

Linear combination of numbers that equal a given sum c++ gfg

Answer 1

Answer:

Combinational Sum. Given an array of positive integers arr[] and a sum x, find all unique combinations in arr[] where the sum is equal to x. The same repeated number may be chosen from arr[] unlimited number of times. Elements in a combination (a1, a2, …, ak) must be printed in non-descending order.

Hope it will help you

Please mark me the braniest