not passing one test case
Subset sum dp----
@i_am_dekard_shaw
Your algorithm was wrong.
this problem is quite similar to the knapsack problem but due to large constrainst you have to do the following problem using 1D DP.
pls provide me the algo …
its difficult to understand through code
for each number:
if curtarget - num is true, then curtarget will also be true.
because if you can form "curtarget-num " sum, then curtarget is also possible.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.