Bell Numbers Problem using Dynamic Programming

[abhisheks008]

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

• Hacktoberfest 2021
• Contributor

🔴 Description :
Given a set of n elements, find number of ways of partitioning it.
Examples:

Input:  n = 2
Output: Number of ways = 2
Explanation: Let the set be {1, 2}
            { {1}, {2} } 
            { {1, 2} }

🔴 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