101112131415161718192021222324

class Solution {
    // Helper function to count subsequences
    // with the target sum
    func(ind, sum, nums) {
        // Base case: if sum is 0, one valid subsequence is found
        if (sum === 0) return 1;
        // Base case: if sum is negative or index exceeds array size
        if (sum < 0 || ind === nums.length) return 0;
        // Recurse by including current number or excluding it from the sum
        return this.func(ind + 1, sum - nums[ind], nums) + this.func(ind + 1, sum, nums);
    }

    // Function to start counting subsequences
    countSubseqenceWithTargetSum(nums, target) {
        return this.func(0, target, nums);
    }
}

// Main function to test the solution
const sol = new Solution();
const nums = [1, 2, 3, 4, 5];
const target = 5;
console.log(`Number of subsequences with target sum ${target}: ${sol.countSubsequenceWithTargetSum(nums, target)}`);

1234567891011121314151617181920212223242526272829303132

using System;

public class Solution {
    // Helper function to count subsequences
    // with the target sum
    private int CountSubsequencesRecursive(int ind, int currentSum, int[] nums) {
        // Base case: if sum is 0, one valid subsequence is found
        if (currentSum == 0) {
            return 1;
        }
        // Base case: if sum is negative or index exceeds array size
        if (currentSum < 0 || ind == nums.Length) {
            return 0;
        }
        // Recurse by including current number or excluding it from the sum
        return CountSubsequencesRecursive(ind + 1, currentSum - nums[ind], nums) +
               CountSubsequencesRecursive(ind + 1, currentSum, nums);
    }

    // Function to start counting subsequences
    public int CountSubsequenceWithTargetSum(int[] nums, int target) {
        return CountSubsequencesRecursive(0, target, nums);
    }

    public static void Main(string[] args) {
        // Main function to test the solution
        Solution sol = new Solution();
        int[] nums = {1, 2, 3, 4, 5};
        int target = 5;
        Console.WriteLine($"Number of subsequences with target sum {target}: {sol.CountSubsequenceWithTargetSum(nums, target)}");
    }
}

12345678910111213141516171819202122232425262728293031

package main

import "fmt"

// func is a helper to count subsequences with the target sum
func funcCount(ind, sum int, nums []int) int {
    // Base case: if sum is 0, one valid subsequence is found
    if sum == 0 {
        return 1
    }
    // Base case: if sum is negative or index exceeds array size
    if sum < 0 || ind == len(nums) {
        return 0
    }
    // Recurse by including curren