 New update is available. Click here to update.

# Combination Sum IV

Contributed by
Last Updated: 23 Feb, 2023
Medium 0/80 Share 18 upvotes

## Problem Statement

#### But if way1 =[1,2,3,4] and way2= [4,3,2,1] then both ways are different.

##### For Example:
``````If N = 3 and tar = 5 and array elements are [1,2,5] then the number of possible ways of making sum = 5 are:
(1,1,1,1,1)
(1,1,1,2)
(1,2,1,1)
(2,1,1,1)
(1,1,2,1)
(2,2,1)
(1,2,2)
(2,1,2)
(5)
Hence the output will be 9.
``````
Detailed explanation ( Input/output format, Notes, Images ) ##### Constraints:
``````1 <= N <= 200
1 <= nums[i] <= 1000
All the elements will be unique
1 <= tar <= 1000

Time limit: 1 sec
``````
##### Sample Input 1 :
``````2
3 5
1 2 5
2 3
1 2
``````
##### Sample output 1 :
``````9
3
``````
##### Explanation For Sample Output 1:
``````For the first test case, the number of possible ways will be
(1,1,1,1,1)
(1,1,1,2)
(1,2,1,1)
(2,1,1,1)
(1,1,2,1)
(2,2,1)
(1,2,2)
(2,1,2)
(5)

For the second test case, the number of ways will be
(1,1,1)
(1,2)
(2,1)
Here you can see we have considered (1,2) and (2,1) in 2 different ways.
``````
##### Sample Input 2 :
``````2
3 4
12 1 3
2 41
2 34
``````
##### Sample output 2 :
``````3
0
``````  Autocomplete Console