JB TAK FODEGA NHI .... TB TK CHODEGA NHI .... (MAANG)

L11 Combination Sum IV

Given an array of distinct integers nums and a target integer target, return the number of possible combinations that add up to target.
The test cases are generated so that the answer can fit in a 32-bit integer.

Example 1:
nput: nums = [1,2,3], target = 4
Output: 7
Explanation:
The possible combination ways are:
(1, 1, 1, 1)
(1, 1, 2)
(1, 2, 1)
(1, 3)
(2, 1, 1)
(2, 2)
(3, 1)
Note that different sequences are counted as different combinations.

Example 2:
Input: nums = [9], target = 3
Output: 0

Constraints:
- 1 <= nums.length <= 200
- 1 <= nums[i] <= 1000
- All the elements of nums are unique.
- 1 <= target <= 1000

Notes

Note: Zoom for Better Understanding

Extended Version of the L9 Combination Sum II

Bascially our Task is cout all the Possible and Unique Subsecquance.

Approch

In L9 Combination Sum II ouir task is print all the unique, lexagraphysical, adn Sorted Order Combination

Similler in this Problem our task is cout all the possible Combination of the Array

Concept and Login will be Same that we used in the L9 Combination Sum II only few steps will be changed

Again follow Pick and Not Pick Concept

We chosse any element any number of thime its totally depends on you for constructing the Unique Combination

Recursive Tree

Code Zone!

Time Complexity:O(2 ^ n * k)
Reason:O(2 ^ N) Number of the Combination Expointinal
k: for put the subsecquance into the DS every Time
Space Complexity:O(k * x * N)

k: average len if the every Subsecquance

x: for combinations/li>

N: Recursion stack Space

Now the Constrain is Very Highe So this Solution gives TLE Now time to Optimized

Recursion

Memoization

Tabulation

Memoization, Tabulation and Space Optimization we leard in th DP Series ..... Soon

Code Zone!