Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Count characters at same position as in English alphabet

  • Difficulty Level : Basic
  • Last Updated : 29 Apr, 2021

Given a string of lower and uppercase characters, the task is to find that how many characters are at same position as in English alphabet.
Examples: 
 

Input:  ABcED 
Output :  3
First three characters are at same position
as in English alphabets.

Input:  geeksforgeeks 
Output :  1
Only 'f' is at same position as in English
alphabet

Input :  alphabetical 
Output :  3

 

For this we can have simple approach: 
 

1) Initialize result as 0.
2) Traverse input string and do following for every 
   character str[i]
     a) If 'i' is same as str[i] - 'a' or same as 
        str[i] - 'A', then do result++
3) Return result

 

C++




// C++ program to find number of characters at same
// position as in English alphabets
#include<bits/stdc++.h>
using namespace std;
 
int findCount(string str)
{
    int result = 0;
 
    // Traverse input string
    for (int i = 0 ; i < str.size(); i++)
 
        // Check that index of characters of string is
        // same as of English alphabets by using ASCII
        // values and the fact that all lower case
        // alphabetic characters come together in same
        // order in ASCII table.  And same is true for
        // upper case.
        if (i == (str[i] - 'a') || i == (str[i] - 'A'))
            result++;
 
 
    return result;
}
 
// Driver code
int main()
{
    string str = "AbgdeF";
    cout << findCount(str);
    return 0;
}
Java



// Java program to find number of
// characters at same position
// as in English alphabets
class GFG
{
 
    static int findCount(String str)
    {
        int result = 0;
 
        // Traverse input string
        for (int i = 0; i < str.length(); i++)
         
        // Check that index of characters
        // of string is same as of English
        // alphabets by using ASCII values
        // and the fact that all lower case
        // alphabetic characters come together
        // in same order in ASCII table. And
        // same is true for upper case.
        {
            if (i == (str.charAt(i) - 'a')
                    || i == (str.charAt(i) - 'A'))
            {
                result++;
            }
        }
        return result;
    }
 
    // Driver code
    public static void main(String[] args)
    {
        String str = "AbgdeF";
        System.out.print(findCount(str));
    }
}
 
// This code is contributed by Rajput-JI
Python3



# Python program to find number of
# characters at same position as
# in English alphabets
 
# Function to count the number of
# characters at same position as
# in English alphabets
def findCount(str):
    result = 0
 
    # Traverse the input string
    for i in range(len(str)):
 
        # Check that index of characters of string is
        # same as of English alphabets by using ASCII
        # values and the fact that all lower case
        # alphabetic characters come together in same
        # order in ASCII table. And same is true for
        # upper case.
        if ((i == ord(str[i]) - ord('a')) or
            (i == ord(str[i]) - ord('A'))):
            result += 1
    return result
 
# Driver Code
str = 'AbgdeF'
print(findCount(str))
 
# This code is contributed
# by SamyuktaSHegde
C#



// C# program to find number of
// characters at same position
// as in English alphabets
using System;
 
class GFG
{
static int findCount(string str)
{
    int result = 0;
 
    // Traverse input string
    for (int i = 0 ; i < str.Length; i++)
 
        // Check that index of characters
        // of string is same as of English
        // alphabets by using ASCII values
        // and the fact that all lower case
        // alphabetic characters come together
        // in same order in ASCII table. And
        // same is true for upper case.
        if (i == (str[i] - 'a') ||
            i == (str[i] - 'A'))
            result++;
 
    return result;
}
 
// Driver code
public static void Main()
{
    string str = "AbgdeF";
    Console.Write(findCount(str));
}
}
 
// This code is contributed
// by Akanksha Rai
PHP



<?php
// PHP program to find number of
// characters at same position as
// in English alphabets
 
// Function to count the number of
// characters at same position as
// in English alphabets
function findCount($str)
{
    $result = 0;
 
    // Traverse the input string
    for ($i = 0; $i < strlen($str); $i++)
    {
 
        // Check that index of characters of string is
        // same as of English alphabets by using ASCII
        // values and the fact that all lower case
        // alphabetic characters come together in same
        // order in ASCII table. And same is true for
        // upper case.
        if (($i == ord($str[$i]) - ord('a')) or
            ($i == ord($str[$i]) - ord('A')))
            $result += 1;
    }
    return $result;
}
 
// Driver Code
$str = "AbgdeF";
print(findCount($str))
 
// This code has been contributed by 29AjayKumar
?>
Javascript



<script>
      // JavaScript program to find number of characters at same
      // position as in English alphabets
 
      function findCount(str) {
        var result = 0;
 
        // Traverse input string
        for (var i = 0; i < str.length; i++)
          // Check that index of characters of string is
          // same as of English alphabets by using ASCII
          // values and the fact that all lower case
          // alphabetic characters come together in same
          // order in ASCII table. And same is true for
          // upper case.
          if (
            i === str[i].charCodeAt(0) - "a".charCodeAt(0) ||
            i === str[i].charCodeAt(0) - "A".charCodeAt(0)
          )
            result++;
 
        return result;
      }
 
      // Driver code
      var str = "AbgdeF";
      document.write(findCount(str));
    </script>
Output: 
 
 5
 
This article is contributed by Sahil Chhabra. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 

My Personal Notes
arrow_drop_up
Previous
Find k'th character of decrypted string | Set 1
Next

Count words present in a string
Recommended Articles
Page :
Check if frequency of each character is equal to its position in English Alphabet
20, May 20
For each lowercase English alphabet find the count of strings having these alphabets
27, Apr 20
Minimize replacements by previous or next alphabet required to make all characters of a string the same
19, Oct 20
Rearrange the characters of the string such that no two adjacent characters are consecutive English alphabets
25, Jul 19
Find letter's position in Alphabet using Bit operation
13, May 19
Count of character pairs at same distance as in English alphabets
11, Jan 17
Minimize replacement of characters to its nearest alphabet to make a string palindromic
12, Sep 20
Longest substring with no pair of adjacent characters are adjacent English alphabets
10, Feb 21
Reorder characters of a string to valid English representations of digits
13, Apr 21
Count Strings that does not contain any alphabet's both uppercase and lowercase
02, Dec 21
Check whether two strings contain same characters in same order
31, May 19
Check if given strings can be made same by swapping two characters of same or different strings
07, Dec 20
Min flips of continuous characters to make all characters same in a string
12, Jul 17
String with k distinct characters and no same characters adjacent
25, Oct 17
Minimum characters that are to be inserted such that no three consecutive characters are same
30, Sep 19
Minimum characters to be replaced to make frequency of all characters same
30, Apr 20
Make all characters of a string same by minimum number of increments or decrements of ASCII values of characters
10, Feb 21
Minimize swaps of same-indexed characters to make sum of ASCII value of characters of both the strings odd
10, Feb 21
Modify characters of a string by adding integer values of same-indexed characters from another given string
01, Mar 21
Rearrange characters in a sorted string such that no pair of adjacent characters are the same
23, Jul 21
Minimize swaps of pairs of characters required such that no two adjacent characters in the string are same
09, Jul 21
Minimum characters to be replaced in given String to make all characters same
13, Jan 22
Latin alphabet cipher
11, May 18
Smallest alphabet greater than a given character
13, Jun 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Basic





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

Start Your Coding Journey Now!