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.
That is exactly what nC2 is - if you breakdown the general formula of nCr replace r with 2 - it comes to n*(n-1)/2 which is equal to the sum of all positive integers till (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 Anagrams
You are viewing a single comment's thread. Return to all comments →
That is exactly what nC2 is - if you breakdown the general formula of nCr replace r with 2 - it comes to n*(n-1)/2 which is equal to the sum of all positive integers till (n-1)