Update backtracking/subset_sum.cpp

Co-authored-by: Abhinn Mishra <49574460+mishraabhinn@users.noreply.github.com>
This commit is contained in:
Swastika Gupta
2021-07-06 09:12:21 +05:30
committed by GitHub
parent 71a742ec7d
commit 1b82d4991b

View File

@@ -1,7 +1,6 @@
/**
* @file
* @brief Program to Count number of subsets (non-continuous
* subarrays) with a given sum
* @brief We are given with an array and a sum value. The algorithms find all the subsets of that array with sum equal to given sum and return such subsets count. This approach will have exponential time complexity.
*
* @details Subset problem (https://en.wikipedia.org/wiki/Subset_sum_problem)
* @author [Swastika Gupta](https://github.com/swastyy)