Subset Sum Problem using Dynamic Programming

[abhisheks008]

🔴 Title : Subset Sum Problem using Dynamic Programming
🔴 Language used : Python 3
🔴 Directory : Dynamic Programming
🔴 Name : Abhishek Sharma
🔴 Contribution type :

• Hacktoberfest 2021
• Contributor

🔴 Description :
Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given sum.

Example:

Input: set[] = {3, 34, 4, 12, 5, 2}, sum = 9
Output: True  
There is a subset (4, 5) with sum 9.

🔴 Method : Dynamic Programming

@prathimacode-hub Please assign me this issue, I'll be contributing as a Hacktoberfest 2021 participant.

[prathimacode-hub]

Issue assigned to @abhisheks008