mihail gaberov

Qui docet, discit.

How to solve the Sherlock and Anagrams coding challenge in JavaScript

Last updated: Feb 12, 2024

Solve "Sherlock and Anagrams" coding challenge in JavaScript

Photo by Javier Quesada on Unsplash

This post is going to get you through my solution of a coding challenge called "Sherlock and Anagrams". You may take a look at it in HackerRank. I spent a lot of time trying to solve it, with JavaScript. When I tried to google it, I could not find a decent JS solution. I found just one and it was not working correctly. Also any explanations were completely out of the question. That's why I decided to write an article about it and try to put some nice and easy to digest explanations along the way. Keep reading now!

⚠ CAUTION: I will roll out my solution below with short explanations about each of the steps. If you want to give a try yourself, please stop here and go to HackerRank site.


Two strings are anagrams of each other if the letters of one string can be rearranged to form the other string. Given a string, find the number of pairs of substrings of the string that are anagrams of each other.

For example s = mom, the list of all anagrammatic pairs is [m, m], [mo, om] at positions [[0], [2]], [[0, 1], [1, 2]] respectively.


Length of the input string: 2 ≤ |s| ≤ 100

String s contains only lowercase letters from the range ascii[a-z].


First thing first - we need to get a better understanding of the whole problem. What is an anagram? What is an anagrammatic pair? Can I see one? Also, what exactly does it mean substrings?

In other words, we need to have a clear picture of what are we trying to solve, before solving it.

From the description of the problem we can deduct all we need. Keep walking! 🚶

I think here is a good moment to mention that the challenge in question is under "Dictionaries and Hashmaps" section in HackerRank website, so it's very likely for one to think, that probably he has to use this kind of data structures when solving it. 😇


Since we are going to look for anagrams, let's start with them. As it is described above, an anagram of one word is another word, that has the same length and is created with the same characters from the former one.

So we will have to look for words and compare them with other words, in order to see if they are anagrammatic pairs. Once found, we will just count them.

Anagrammatic pairs

After we saw what an anagram is, it should be relatively easy to conclude, that anagrammatic pair is just two strings that are anagrams. Such as "mo" and "om", or "listen" and "silent". We will have to count how many pairs like this could be found in a given string. In order to do that, we need to split this original string to substrings.


Substrings, as the name infer, are parts of a string. These parts could be just a letter or a pair of letters, such as what have we seen in the example above - "m" or "mo". In our solution we will split the original string to such substrings and then we will go over them and do the comparison, which will tell us whether we have anagrammatic pairs among them.


Now, when we did our analysis, it's showtime! 🎆

Let's summarize:

  • We need to find all substrings of the given string - create a method for that.
  • We need to be able to check if two strings are anagrams - create a method for that.
  • We need to count all anagrammatic pairs in the given string - create a method for that.
  • Combine everything from above and spit the result - create a method for that.
  • Get all substrings

    This would be our helper method for finding all substring of a given string:

    function getAllSubstrings(str) {
      let i, j, result = [];
      for (i = 0; i < str.length; i++) {
        for (j = i + 1; j < str.length + 1; j++) {
          result.push(str.slice(i, j))
      return result

    As you can see, it has O(n^2) time complexity, but for our case it does the job, because we have limited length of the input string (up to 100 characters).

    Check for anagrams

    This would be our helper method for checking if two strings are anagrammatic pair:

    function isAnagram(str1, str2) {
      const hist = {}
      for (let i = 0; i < str1.length; i++) {
        const char = str1[i]
        if (hist[char]) {
        } else {
          hist[char] = 1
      for (let j = 0; j < str2.length; j++) {
        const char = str2[j]
        if (hist[char]) {
        } else {
          return false
      return true

    ❕ You remember, judging by the section where this challenge belongs, we assumed that most probably we will have to use data structures such as hashmaps or dictionaries. Here is the moment to notice that. We use a simple JavaScript object to play the role of a hashmap. We do two iterations - one per string. When we iterate over the first one, we add its characters as keys to the hashmap and count their appearances, which are going to be stored as their values. Then we do another iteration over the second string. Check if its characters are stored in our hashmap. If yes - decrement their value. If there are missing characters, which means the two strings are not anagrammatic pair, we simply return false. If both loops complete, we return true, signifying that the strings being analysed are anagrammatic pair.

    Do the counting

    This is the method, where we will use the helper for checking if a pair is anagrammatic and count it. We do that with the help of JavaScript arrays and the methods they provide. We iterate over an array containing all the substrings of the original string. Then we get the currect element and remove it from the array. And then we do another loop through that array and return 1 if we find that there is an anagram of the current element. If nothing is found, we return 0.

    function countAnagrams(currentIndex, arr) {
      const currentElement = arr[currentIndex]
      const arrRest = arr.slice(currentIndex + 1)
      let counter = 0
      for (let i = 0; i < arrRest.length; i++) {
        if (currentElement.length === arrRest[i].length && isAnagram(currentElement, arrRest[i])) {
     return counter

    And in the end

    The only thing left to be done now is to combine all of the above and spit the desired result. Here is how the final method looks like:

    function sherlockAndAnagrams(s) {
      const duplicatesCount = s.split('').filter((v, i) => s.indexOf(v) !== i).length
      if (!duplicatesCount) return 0
      let anagramsCount = 0
      const arr = getAllSubstrings(s)
      for (let i = 0; i < arr.length; i++) {
        anagramsCount += countAnagrams(i, arr)
      return anagramsCount

    Maybe you have noticed, here I am checking first for duplicates, in order to know if I should continue further. As if there are no duplicated letters, then it's not possible to have an anagram.

    And finally, we get all substrings into an array, iterate over it, count the anagrammatic pairs that are found and return this number. You can find the full code here.


    This kind of exercises are very good for making you think algorithmically, but also they change your way of working in your day to day job. My recommendation would be to do the same I am trying to do - train your brain now and then with one of those. And if you can - share. I know sometimes you don't have time for such challenges, but when you do - go for it.

    My personal feeling, after finishing this, was complete satisfaction, which is understandable, considering the time it took me to do it. But at the end, dear reader, I am even happier I can share this experience with you 😌!

    🔥 Thanks for reading! 🔥

    You earned a free joke. Rate this article to get it.
    ← Go home