(12) DP: Friends Pairing Problem

Question Link Difficulty: Easy Problem Statement: Given N find a total number of ways in which it can pair up or remain single. Approach: If N = 1 then it can only remain in single. For N = 2 it can remain single or pair up. For N = 3 and above first...