DSA
DSA copied to clipboard
Target Sum Subsets
You are given a number n, representing the count of elements and a given target value as input. You are required to calculate and print true or false, if there is a subset the elements of which add up to given target or not.
I can do this task with maximum optimization with tabulation method in dynamic programming. Please assign this task to me @arnab2001 .