DSA - Level 1 - Friends Pairing Problem Dynamic Programming | Explanation with Code

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that. NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the Friends Pairing problem where we are required to print the number of ways in which n friends can pair up where each person has two options, either to pair up or to stay single. In this problem, 1. You are given a number n, representing the number of friends. 2. Each friend can stay single or pair up with any of it's friends. 3. You are required to print the number of ways in which these friends can stay single or pair up. E.g. 1 person can stay single or pair up in 1 way. 2 people can stay singles or pair up in 2 ways. 12 = 1-2, 12. 3 people (123) can stay singles or pair up in 4 ways. 123 = 1-2-3, 12-3, 13-2, 23-1. To attempt and submit this question, click here: https://www.pepcoding.com/resources/online-java-foundation/dynamic-programming-and-greedy/friends-pairing-official/ojquestion For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation #dp #dynamicprogramming Have a look at our result: https://www.pepcoding.com/placements Follow us on our FB page: https://www.facebook.com/pepcoding Follow us on Instagram: https://www.instagram.com/pepcoding Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education