Friends Pairing Problem using Dynamic Programming

[abhisheks008]

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

• Hacktoberfest 2021
• Contributor

🔴 Description :
Given n friends, each one can remain single or can be paired up with some other friend. Each friend can be paired only once. Find out the total number of ways in which friends can remain single or can be paired up.

Examples:

Input  : n = 3
Output : 4

🔴 Method : Dynamic Programming

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