Breaking News: Grepper is joining You.com. Read the official announcement!

explanation: in the above given, two names a and y are common letters that are occurring one time(common count) in both names, so we are removing these letters from both names. now count the total letters that are left here it is 5. now start removing let

Mohamed Yassine Ben Othman answered on August 20, 2022 Popularity 1/10 Helpfulness 1/10

answer explanation: in the above given, two names a and y are common letters that are occurring one time(common count) in both names, so we are removing these letters from both names. now count the total letters that are left here it is 5. now start removing let

explanation: in the above given, two names a and y are common letters that are occurring one time(common count) in both names, so we are removing these letters from both names. now count the total letters that are left here it is 5. now start removing let

Comment

// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to return the count of
// valid indices pairs
int countPairs(string s1, int n1, string s2, int n2)
{
 
    // To store the frequencies of characters
    // of string s1 and s2
    int freq1[26] = { 0 };
    int freq2[26] = { 0 };
 
    // To store the count of valid pairs
    int i, count = 0;
 
    // Update the frequencies of
    // the characters of string s1
    for (i = 0; i < n1; i++)
        freq1[s1[i] - 'a']++;
 
    // Update the frequencies of
    // the characters of string s2
    for (i = 0; i < n2; i++)
        freq2[s2[i] - 'a']++;
 
    // Find the count of valid pairs
    for (i = 0; i < 26; i++)
        count += (min(freq1[i], freq2[i]));
 
    return count;
}
 
// Driver code
int main()
{
    string s1 = "geeksforgeeks", s2 = "platformforgeeks";
    int n1 = s1.length(), n2 = s2.length();
    cout << countPairs(s1, n1, s2, n2);
 
    return 0;
}

Popularity 1/10 Helpfulness 1/10 Language typescript

Source: www.geeksforgeeks.org

Tags: count let letters names typescript

Link to this answer
Share Copy Link

Contributed on Aug 20 2022

Mohamed Yassine Ben Othman

0 Answers Avg Quality 2/10

explanation: in the above given, two names a and y are common letters that are occurring one time(common count) in both names, so we are removing these letters from both names. now count the total letters that are left here it is 5. now start removing let

Contents

More Related Answers

explanation: in the above given, two names a and y are common letters that are occurring one time(common count) in both names, so we are removing these letters from both names. now count the total letters that are left here it is 5. now start removing let

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.