Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Last Updated: 28 Jan, 2021

Combination Sum II

Moderate
Asked in companies
UberAdobe

Problem statement

You are given an array ‘arr’ of ‘n’ positive integers.


You are also given a positive integer ‘target’.


Your task is to find all unique combinations of elements of array ‘arr’ whose sum is equal to ‘target’. Each number in ‘arr’ may only be used once in the combination.


Elements in each combination must be in non-decreasing order and you need to print all unique combinations in lexicographical order.


Note:
In lexicographical order, combination/array  ‘a’  comes before array ‘b’ if at the first index 'i' where 'a[i]' differs from 'b[i]', 'a[i]' < 'b[i]  or length of 'a' is less than 'b'.


Example:
Input: ‘arr’ = [1, 2, 3, 1], ‘target’ = 5. 

Output: [[1,1,3], [2,3]]

Explanation:
All possible valid combinations with sum = 5 in lexicographical order are -:
(1, 1, 3)
(2, 3)


Input Format:
Then the first line of input contains two space-separated integers  ‘n’ and ‘target’ denoting the number of elements in ‘arr’ and the ‘target'.

The second line of input contains 'n' space-separated integers the elements of array ‘arr’.


Output Format:
Print all possible valid combinations in a separate line in the lexicographical order. Elements in each combination must be in non-decreasing order.


Note:
You do not need to print anything, it has already been taken care of. Just implement the given function.

Approaches

01 Approach

First, sort the given array in non-decreasing order, it will help to generate combinations in non-decreasing order.  There will be 2 ^ N possible combinations of the given array, We create a vector ‘result’ and then we one by one check for all possible combinations, whether the sum of its elements is equal to ‘target’ or not. If the sum of the combination is equal to ‘target’, we will append it in vector ‘result’.

 

We finally sort vector ‘result’ in lexicographical order and remove all duplicates from it.

 

We can find all combinations of array both iteratively or recursively, Here, we will be using the iterative approach only.

 

Algorithm:

 

  • Sort the given array ‘arr’.
  • Create a vector ‘result’ It will keep all combinations having sum equal to ‘target’.
  • Run a loop where ‘i’ ranges from 0 to 2^N-1, and in each iteration do the following -:
    • Create an empty vector ‘comb’
    • Run a loop where ‘j’ ranges from 0 to N - 1 and if ‘jth’ bit is set in ‘i’ then append element arr[j] in ‘comb’.
    • If the sum of all elements of ‘comb’ is equal to ‘target’ then add it in vector ‘result’
    • Sort the vector ‘result’
    • Remove all duplicates from vector ‘result’.  This can be done easily by either using built-in library functions or using the fact that duplicate entries are grouped together after sorting.
  • Return ‘result’.