Skip to content
Related Articles

Related Articles

Improve Article
Check if frequency of each character is equal to its position in English Alphabet
  • Last Updated : 13 May, 2021

Given string str of lowercase alphabets, the task is to check if the frequency of each distinct characters in the string equals to its position in the English Alphabet. If valid, then print “Yes”, else print “No”.

Examples: 

Input: str = “abbcccdddd” 
Output: Yes 
Explanation: 
Since frequency of each distinct character is equals to its position in English Alphabet, i.e. 
F(a) = 1, 
F(b) = 2, 
F(c) = 3, and 
F(d) = 4 
Hence the output is Yes.

Input: str = “geeksforgeeks” 
Output: No 

Approach: 



  1. Store the frequency of each character in an array of 26, for hashing purpose.
  2. Now traverse the hash array and check if the frequency of each character at an index i is equal to (i + 1) or not.
  3. If yes, then print “Yes”, Else print “No”.

Below is the implementation of the above approach: 

C++




// C++ program for the above approach
 
#include "bits/stdc++.h"
using namespace std;
 
bool checkValidString(string str)
{
 
    // Initialise frequency array
    int freq[26] = { 0 };
 
    // Traverse the string
    for (int i = 0; str[i]; i++) {
 
        // Update the frequency
        freq[str[i] - 'a']++;
    }
 
    // Check for valid string
    for (int i = 0; i < 26; i++) {
 
        // If frequency is non-zero
        if (freq[i] != 0) {
 
            // If freq is not equals
            // to (i+1), then return
            // false
            if (freq[i] != i + 1) {
                return false;
            }
        }
    }
 
    // Return true;
    return true;
}
 
// Driver Code
int main()
{
 
    // Given string str
    string str = "abbcccdddd";
 
    if (checkValidString(str))
        cout << "Yes";
    else
        cout << "No";
 
    return 0;
}
Java



// Java program for the above approach
class GFG{
 
static boolean checkValidString(String str)
{
     
    // Initialise frequency array
    int freq[] = new int[26];
 
    // Traverse the String
    for(int i = 0; i < str.length(); i++)
    {
        
       // Update the frequency
       freq[str.charAt(i) - 'a']++;
    }
 
    // Check for valid String
    for(int i = 0; i < 26; i++)
    {
        
       // If frequency is non-zero
       if (freq[i] != 0)
       {
            
           // If freq is not equals
           // to (i+1), then return
           // false
           if (freq[i] != i + 1)
           {
               return false;
           }
       }
    }
     
    // Return true;
    return true;
}
 
// Driver Code
public static void main(String[] args)
{
 
    // Given String str
    String str = "abbcccdddd";
 
    if (checkValidString(str))
    {
        System.out.print("Yes");
    }
    else
    {
        System.out.print("No");
    }
}
}
 
// This code is contributed by sapnasingh4991
Python3



# Python3 program for the
# above approach
def checkValidString(str):
 
    # Initialise frequency array
    freq = [0 for i in range(26)]
 
    # Traverse the string
    for i in range(len(str)):
 
        # Update the frequency
        freq[ord(str[i]) - ord('a')] += 1
 
    # Check for valid string
    for i in range(26):
 
        # If frequency is non-zero
        if(freq[i] != 0):
 
            # If freq is not equals
            # to (i+1), then return
            # false
            if(freq[i] != i + 1):
                return False
    # Return true
    return True
 
# Driver Code
 
# Given string str
str = "abbcccdddd"
 
if(checkValidString(str)):
    print("Yes")
else:
    print("No")
 
# This code is contributed by avanitrachhadiya2155
C#



// C# program for the above approach
using System;
class GFG{
 
static bool checkValidString(String str)
{
     
    // Initialise frequency array
    int []freq = new int[26];
 
    // Traverse the String
    for(int i = 0; i < str.Length; i++)
    {
         
        // Update the frequency
        freq[str[i] - 'a']++;
    }
 
    // Check for valid String
    for(int i = 0; i < 26; i++)
    {
         
        // If frequency is non-zero
        if (freq[i] != 0)
        {
                 
            // If freq is not equals
            // to (i+1), then return
            // false
            if (freq[i] != i + 1)
            {
                return false;
            }
        }
    }
     
    // Return true;
    return true;
}
 
// Driver Code
public static void Main(String[] args)
{
 
    // Given String str
    String str = "abbcccdddd";
 
    if (checkValidString(str))
    {
        Console.Write("Yes");
    }
    else
    {
        Console.Write("No");
    }
}
}
 
// This code is contributed by sapnasingh4991
Javascript



<script>
 
// Javascript program for the above approach
function checkValidString(str)
{
     
    // Initialise frequency array
    var freq = new Array(26).fill(0);
     
    // Traverse the String
    for(var i = 0; i < str.length; i++)
    {
         
        // Update the frequency
        freq[str[i].charCodeAt(0) -
                "a".charCodeAt(0)]++;
    }
     
    // Check for valid String
    for(var i = 0; i < 26; i++)
    {
         
        // If frequency is non-zero
        if (freq[i] !== 0)
        {
             
            // If freq is not equals
            // to (i+1), then return
            // false
            if (freq[i] !== i + 1)
            {
                return false;
            }
        }
    }
     
    // Return true;
    return true;
}
 
// Driver Code
 
// Given String str
var str = "abbcccdddd";
 
if (checkValidString(str))
{
    document.write("Yes");
}
else
{
    document.write("No");
}
 
// This code is contributed by rdtank
 
</script>
Output: 
Yes
 
Time Complexity: O(N), where N is the length of the string. 
Auxiliary Space: O(26)
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 industry experts, please refer DSA Live Classes 



My Personal Notes
arrow_drop_up
Previous
BufferedInputStream mark() method in Java with Examples
Next

LocalDate of() method in Java with Examples
Recommended Articles
Page :
Count characters at same position as in English alphabet
07, Dec 16
Check input character is alphabet, digit or special character
15, Oct 17
Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
16, Nov 18
For each lowercase English alphabet find the count of strings having these alphabets
27, Apr 20
Longest sub-string having frequency of each character less than equal to k
29, Dec 17
Character whose frequency is equal to the sum of frequencies of other characters of the given string
11, Mar 19
Modify string by replacing characters by alphabets whose distance from that character is equal to its frequency
25, Mar 21
Check if the frequency of any character is more than half the length of the string
23, Apr 19
Find letter's position in Alphabet using Bit operation
13, May 19
Length of the largest substring which have character with frequency greater than or equal to half of the substring
29, May 19
Maximum length prefix such that frequency of each character is atmost number of characters with minimum frequency
30, Mar 20
Smallest alphabet greater than a given character
13, Jun 18
Check if two strings after processing backspace character are equal or not
26, Apr 20
Check if two strings can be made equal by swapping one character among each other
20, Nov 19
Count substrings having frequency of a character exceeding that of another character in a string
27, May 21
Count of character pairs at same distance as in English alphabets
11, Jan 17
Frequency of each character in a String using unordered_map in C++
21, Apr 20
Print the frequency of each character in Alphabetical order
03, Jan 20
Printing frequency of each character just after its consecutive occurrences
08, Sep 18
Frequency of lexicographically Kth smallest character in the a string
10, Feb 21
Print number of words, vowels and frequency of each character
13, Dec 17
Index of character depending on frequency count in string
13, Nov 19
Largest index for each distinct character in given string with frequency K
29, Apr 20
Find the number of occurrences of a character upto preceding position
17, Jul 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
vaidhyanathansm
@vaidhyanathansm
Vote for difficulty





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