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.
Each newly encountered set of characters can form anagrammatic pairs with all previously encountered matching sets of characters. For example, if you encounter the fourth occurrence of a certain set of characters, you can form six pairs between them (0 + 1 + 2 + 3 = 6).
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 →
Each newly encountered set of characters can form anagrammatic pairs with all previously encountered matching sets of characters. For example, if you encounter the fourth occurrence of a certain set of characters, you can form six pairs between them (0 + 1 + 2 + 3 = 6).