Скачать или смотреть Target Sum Problem || Recursion

Hi, i am on way of learning Recursion Specifically and this is the 3rd day.
Mbits
Try it out :

Question :
You are given an array of positive integers and a target sum. Your task is to determine whether there exists a subset of the array whose sum is equal to the given target. If such a subset exists, print **"Yes"**, otherwise print **"No"**.

Write a function to check if the target sum can be formed using any subset of the given array.

---

*Input Format:*
The first line contains an integer n – the size of the array.
The second line contains n space-separated integers – elements of the array.
The third line contains an integer target – the sum to check.


Output Format :
Print "Yes" if a subset with the given sum exists, otherwise print "No".

Example 1 :

Input :
3
1 2 3
6

Output :
Yes

Explanation :
The subset `{1, 2, 3}` adds up to `6`.

Example 2 :

Input :
4
2 4 6 8
5

Output :
No

Explanation :
No subset of `{2, 4, 6, 8}` sums to `5`.

Constraints:
1≤n≤20 (Small input size due to recursive approach)
1≤array[i]≤100
1≤target≤10^4

#coding #dsa #recursion #coderarmy #rohitnegi
#ai #ml #munasah #leetcode #day3 #mbits #Mbits