We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I do realize that. I was just pointing out that the formula given does not do what it was claimed to do.
n choose k gives you the number of combinations, but what you should be looking for here is the number of permutations. That happens to be n!/(n-k)! which in the case at hand is n(n-1)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Sherlock and Pairs
You are viewing a single comment's thread. Return to all comments →
I do realize that. I was just pointing out that the formula given does not do what it was claimed to do.
n choose k gives you the number of combinations, but what you should be looking for here is the number of permutations. That happens to be n!/(n-k)! which in the case at hand is n(n-1)