Please can someone explain the given sample input more elaborately.
Friend Pairing Problem
we define the recurrence for the corresponding problem as
F(n) = F(n-1) + (n-1)*F(n-2)
ie keep it single or pair it with any of the others.
You can find answer to sample given test case using this.
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.