Reecursion problem Subset sum easy

#1

Sir, the code is working fine but the test cases are not passed idk why… plz check the code

#2

Testcase :
Input :
1
4
1 2 8 -3

Expected Output : Yes (because of presence of subset {1,2,-3} which has sum 0 )

Your Output : No

There’s really no need to use DP in this question. Look at the constraints. The maximum number of elements is 4. You can use simple recursion to solve this problem.