Skip to content
Related Articles

Related Articles

Improve Article

Count of anagrams of each string in an array present in another array

  • Difficulty Level : Easy
  • Last Updated : 24 May, 2021
Geek Week

Given two arrays arr1[] and arr2[] consisting of strings, the task is to print the count of anagrams of every string in arr2[] that are present in arr1[].

Examples: 

Input: arr1[] = [“geeks”, “learn”, “for”, “egeks”, “ealrn”], arr2[] = [“kgees”, “rof”, “nrael”] 
Output: 2 1 2 
Explanation: 
Anagrams of arr2[0] (“kgees”) in arr1 : “geeks” and “egeks”. 
Anagrams of arr2[1] (“rof”) in arr1 : “for”. 
Anagrams of arr2[2] (“nrael”) in arr1 : “learn” and “ealrn”.

Input: arr1[] = [“code”, “to”, “grow”, “odce”], arr2[] = [“edoc”, “wgor”, “ot”] 
Output: 2 1 1 
Explanation: 
Anagrams of arr2[0] (“edoc”) in arr1 “code” and “odce”. 
Anagrams of arr2[1] (“wgor”) in arr1 “grow”. 
Anagrams of arr2[2] (“ot”) in arr1 “to” 

Approach: 
To solve the problem, the idea is to use frequency-counting with the help of HashMap. Store the frequencies of every string in arr1[] in hashmap in their sorted form. Traverse arr2[], sort strings in arr2[], and print their respective frequencies in HashMap.



Below is the implementation of the above approach:  

C++




// C++ Program to count the
// number of anagrams of
// each string in a given
// array present in
// another array
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to return the
// count of anagrams
void count(string arr1[],
           string arr2[],
           int n, int m)
{
    // Store the frequencies
    // of strings in arr1[]
    map<string, int> freq;
 
    for (int i = 0; i < n; i++) {
 
        // Sort the string
        sort(arr1[i].begin(),
             arr1[i].end());
 
        // Increase its frequency
        // in the map
        freq[arr1[i]]++;
    }
 
    for (int i = 0; i < m; i++) {
 
        // Sort the string
        sort(arr2[i].begin(),
             arr2[i].end());
 
        // Display its anagrams
        // in arr1[]
        cout << freq[arr2[i]]
             << " ";
    }
}
 
// Driver Code
int main()
{
 
    string arr1[] = { "geeks", "learn",
                      "for", "egeks",
                      "ealrn" };
    int n = sizeof(arr1)
            / sizeof(string);
 
    string arr2[] = { "kgees", "rof",
                      "nrael" };
    int m = sizeof(arr2)
            / sizeof(string);
 
    count(arr1, arr2, n, m);
}
Java



// Java program to count the number
// of anagrams of each String in a
// given array present in
// another array
import java.util.*;
 
class GFG{
 
static String sortString(String inputString)
{
     
    // Convert input string to char array
    char tempArray[] = inputString.toCharArray();
       
    // Sort tempArray
    Arrays.sort(tempArray);
       
    // Return new sorted string
    return new String(tempArray);
}
 
// Function to return the
// count of anagrams
static void count(String arr1[],
                  String arr2[],
                  int n, int m)
{
     
    // Store the frequencies
    // of Strings in arr1[]
    HashMap<String, Integer> freq = new HashMap<>();
 
    for(int i = 0; i < n; i++)
    {
         
        // Sort the String
        arr1[i] = sortString(arr1[i]);
         
        // Increase its frequency
        // in the map
        if (freq.containsKey(arr1[i]))
        {
            freq.put(arr1[i],
            freq.get(arr1[i]) + 1);
        }
        else
        {
            freq.put(arr1[i], 1);
        }
    }
 
    for(int i = 0; i < m; i++)
    {
         
        // Sort the String
        arr2[i] = sortString(arr2[i]);
 
        // Display its anagrams
        // in arr1[]
        System.out.print(freq.get(arr2[i]) + " ");
    }
}
 
// Driver Code
public static void main(String[] args)
{
    String arr1[] = { "geeks", "learn",
                      "for", "egeks",
                      "ealrn" };
    int n = arr1.length;
 
    String arr2[] = { "kgees", "rof",
                      "nrael" };
    int m = arr2.length;
 
    count(arr1, arr2, n, m);
}
}
 
// This code is contributed by Amit Katiyar
Python3



# Python3 program to count the number
# of anagrams of each string in a
# given array present in another array
 
# Function to return the count of anagrams
def count(arr1, arr2, n, m):
     
    # Store the frequencies of
    # strings in arr1
    freq = {}
 
    for word in arr1:
         
        # Sort the string
        word = ' '.join(sorted(word))
 
        # Increase its frequency
        if word in freq.keys():
            freq[word] = freq[word] + 1
        else:
            freq[word] = 1
 
    for word in arr2:
         
        # Sort the string
        word = ' '.join(sorted(word))
 
        # Display its anagrams
        # in arr1
        if word in freq.keys():
            print(freq[word], end = " ")
        else:
            print(0, end = " ")
             
    print()    
 
# Driver Code
if __name__ == '__main__':
      
    arr1 = [ "geeks", "learn", "for",
             "egeks", "ealrn" ]
    n = len(arr1)
     
    arr2 = [ "kgees", "rof", "nrael" ]
    m = len(arr2)
 
    count(arr1, arr2, n, m)
 
# This code is contributed by Pawan_29
C#



// C# program to count the number
// of anagrams of each String in a
// given array present in
// another array
using System;
using System.Collections.Generic;
 
class GFG{
 
static String sortString(String inputString)
{
     
    // Convert input string to char array
    char []tempArray = inputString.ToCharArray();
       
    // Sort tempArray
    Array.Sort(tempArray);
       
    // Return new sorted string
    return new String(tempArray);
}
 
// Function to return the
// count of anagrams
static void count(String []arr1,
                  String []arr2,
                  int n, int m)
{
     
    // Store the frequencies
    // of Strings in arr1[]
    Dictionary<String,
               int> freq = new Dictionary<String,
                                          int>();
 
    for(int i = 0; i < n; i++)
    {
         
        // Sort the String
        arr1[i] = sortString(arr1[i]);
         
        // Increase its frequency
        // in the map
        if (freq.ContainsKey(arr1[i]))
        {
            freq[arr1[i]] =
            freq[arr1[i]] + 1;
        }
        else
        {
            freq.Add(arr1[i], 1);
        }
    }
 
    for(int i = 0; i < m; i++)
    {
         
        // Sort the String
        arr2[i] = sortString(arr2[i]);
 
        // Display its anagrams
        // in arr1[]
        Console.Write(freq[arr2[i]] + " ");
    }
}
 
// Driver Code
public static void Main(String[] args)
{
    String []arr1 = { "geeks", "learn",
                      "for", "egeks",
                      "ealrn" };
    int n = arr1.Length;
 
    String []arr2 = { "kgees", "rof",
                      "nrael" };
    int m = arr2.Length;
 
    count(arr1, arr2, n, m);
}
}
 
// This code is contributed by Amit Katiyar
Javascript



<script>
 
// Javascript program to count the number
// of anagrams of each String in a
// given array present in
// another array
 
function sortString(inputString)
{
      
    // Convert input string to char array
    let tempArray = inputString.split('');
        
    // Sort tempArray
    tempArray.sort();
        
    // Return new sorted string
    return tempArray.join("");
}
  
// Function to return the
// count of anagrams
function count(arr1, arr2, n, m)
{
      
    // Store the frequencies
    // of Strings in arr1[]
    let freq = new Map();
  
    for(let i = 0; i < n; i++)
    {
          
        // Sort the String
        arr1[i] = sortString(arr1[i]);
          
        // Increase its frequency
        // in the map
        if (freq.has(arr1[i]))
        {
            freq.set(arr1[i],
            freq.get(arr1[i]) + 1);
        }
        else
        {
            freq.set(arr1[i], 1);
        }
    }
  
    for(let i = 0; i < m; i++)
    {
          
        // Sort the String
        arr2[i] = sortString(arr2[i]);
  
        // Display its anagrams
        // in arr1[]
        document.write(freq.get(arr2[i]) + " ");
    }
}
 
// Driver code
 
    let arr1 = [ "geeks", "learn",
                      "for", "egeks",
                      "ealrn" ];
    let n = arr1.length;
  
    let arr2 = [ "kgees", "rof",
                      "nrael" ];
    let m = arr2.length;
  
    count(arr1, arr2, n, m);
  
 // This code is contributed by souravghosh0416.
</script>
Output: 
2 1 2
 
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.
In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.



My Personal Notes
arrow_drop_up
Previous
PyQt5 QCommandLinkButton – Setting Background Color for Hover states
Next

Minimum number of adjacent swaps required to convert a permutation to another permutation by given condition
Recommended Articles
Page :
Lexicographically smallest and largest anagrams of a string containing another string as its substring
10, Sep 20
Find all substrings that are anagrams of another substring of the string S
13, Apr 21
Count subsequences in first string which are anagrams of the second string
28, Dec 17
Count the number of sub-arrays such that the average of elements present in the sub-array is greater than that not present in the sub-array
10, Apr 19
Sum of frequencies of characters of a string present in another string
22, Feb 21
Check whether two strings are anagrams of each other using unordered_map in C++
02, Aug 19
Check if two Integer are anagrams of each other
30, Sep 19
Count anagrams having first character as a consonant and no pair of consonants or vowels placed adjacently
20, Feb 21
Count Occurrences of Anagrams
09, Sep 18
Check if a string consists of two K-length non-overlapping substrings as anagrams
09, Dec 20
Check if a String contains Anagrams of length K which does not contain the character X
31, Jul 20
Count smaller elements present in the array for each array element
17, Mar 21
Count of strings that can be formed from another string using each character at-most once
08, Aug 18
Split the string into minimum parts such that each part is in the another string
12, Jun 20
Count ways to replace '?' in a Binary String to make the count of 0s and 1s same as that of another string
21, Jul 21
Count the divisors or multiples present in the Array for each element
13, Aug 21
Difference of count of distinct elements present to left and right for each array element
15, Oct 21
Count characters of a string which when removed individually makes the string equal to another string
09, Jun 21
Difference between maximum and minimum of a set of anagrams from an array
08, Feb 21
Print all pairs of anagrams in a given array of strings
01, Aug 14
Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
17, Apr 19
Count unique substrings of a string S present in a wraparound string
09, Feb 21
A Game of Anagrams in Python
06, Jan 16
Given a sequence of words, print all anagrams together using STL
12, Jul 17
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
arjun_rajput
@arjun_rajput
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox