Freinds Pairing problem

I didn’t understand the recursive function

Use this as your recursive relation.
dp[n] = (friendsPairing(n - 1) + (n - 1) * friendsPairing(n - 2));

Have a look at implementation if required here

can u call me? i have a doubt

Ask here only first.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.