All Questions
1 question
5
votes
2
answers
2k
views
Hackerrank.com - Sherlock and Anagrams
Summary: Given a string find the number of anagramic pairs of substrings of it. e.g 'abba' pairs are [a,a],[b,b],[ab,ba],[abb,bba] so we have 4 pairs.
I'm wondering if anyone can help me improve my ...
- 153