diff --git a/backtracking/subset_sum.cpp b/backtracking/subset_sum.cpp
index 8e1ecce79..b5f44a808 100644
--- a/backtracking/subset_sum.cpp
+++ b/backtracking/subset_sum.cpp
@@ -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)