Given a string, write a program to count the occurrence of Lowercase characters, Uppercase characters, Special characters, and Numeric values.
Examples:
Input : #GeeKs01fOr@gEEks07
Output :
Upper case letters : 5
Lower case letters : 8
Numbers : 4
Special Characters : 2
Input : *GeEkS4GeEkS*
Output :
Upper case letters : 6
Lower case letters : 4
Numbers : 1
Special Characters : 2
Approach :
- Scan string str from 0 to length-1.
- check one character at a time based on ASCII values
- if(str[i] >= 65 and str[i] <=90), then it is uppercase letter,
- if(str[i] >= 97 and str[i] <=122), then it is lowercase letter,
- if(str[i] >= 48 and str[i] <=57), then it is number,
- else it is a special character
- Print all the counters
Implementation:
C++
#include<iostream>
using namespace std;
void Count(string str)
{
int upper = 0, lower = 0, number = 0, special = 0;
for ( int i = 0; i < str.length(); i++)
{
if (str[i] >= 'A' && str[i] <= 'Z' )
upper++;
else if (str[i] >= 'a' && str[i] <= 'z' )
lower++;
else if (str[i]>= '0' && str[i]<= '9' )
number++;
else
special++;
}
cout << "Upper case letters: " << upper << endl;
cout << "Lower case letters : " << lower << endl;
cout << "Number : " << number << endl;
cout << "Special characters : " << special << endl;
}
int main()
{
string str = "#GeeKs01fOr@gEEks07" ;
Count(str);
return 0;
}
|
Java
import java.io.*;
class Count
{
public static void main(String args[])
{
String str = "#GeeKs01fOr@gEEks07" ;
int upper = 0 , lower = 0 , number = 0 , special = 0 ;
for ( int i = 0 ; i < str.length(); i++)
{
char ch = str.charAt(i);
if (ch >= 'A' && ch <= 'Z' )
upper++;
else if (ch >= 'a' && ch <= 'z' )
lower++;
else if (ch >= '0' && ch <= '9' )
number++;
else
special++;
}
System.out.println( "Lower case letters : " + lower);
System.out.println( "Upper case letters : " + upper);
System.out.println( "Number : " + number);
System.out.println( "Special characters : " + special);
}
}
|
Python3
def Count( str ):
upper, lower, number, special = 0 , 0 , 0 , 0
for i in range ( len ( str )):
if str [i].isupper():
upper + = 1
elif str [i].islower():
lower + = 1
elif str [i].isdigit():
number + = 1
else :
special + = 1
print ( 'Upper case letters:' , upper)
print ( 'Lower case letters:' , lower)
print ( 'Number:' , number)
print ( 'Special characters:' , special)
str = "#GeeKs01fOr@gEEks07"
Count( str )
|
C#
using System;
class Count {
public static void Main()
{
String str = "#GeeKs01fOr@gEEks07" ;
int upper = 0, lower = 0;
int number = 0, special = 0;
for ( int i = 0; i < str.Length; i++)
{
char ch = str[i];
if (ch >= 'A' && ch <= 'Z' )
upper++;
else if (ch >= 'a' && ch <= 'z' )
lower++;
else if (ch >= '0' && ch <= '9' )
number++;
else
special++;
}
Console.WriteLine( "Upper case letters : " + upper);
Console.WriteLine( "Lower case letters : " + lower);
Console.WriteLine( "Number : " + number);
Console.Write( "Special characters : " + special);
}
}
|
PHP
<?php
function Countt( $str )
{
$upper = 0;
$lower = 0;
$number = 0;
$special = 0;
for ( $i = 0; $i < strlen ( $str ); $i ++)
{
if ( $str [ $i ] >= 'A' &&
$str [ $i ] <= 'Z' )
$upper ++;
else if ( $str [ $i ] >= 'a' &&
$str [ $i ] <= 'z' )
$lower ++;
else if ( $str [ $i ]>= '0' &&
$str [ $i ]<= '9' )
$number ++;
else
$special ++;
}
echo "Upper case letters: " , $upper , "\n" ;
echo "Lower case letters : " , $lower , "\n" ;
echo "Number : " , $number , "\n" ;
echo "Special characters : " , $special ;
}
$str = "#GeeKs01fOr@gEEks07" ;
Countt( $str );
?>
|
Javascript
<script>
function Count(str)
{
var upper = 0,
lower = 0,
number = 0,
special = 0;
for ( var i = 0; i < str.length; i++)
{
if (str[i] >= "A" && str[i] <= "Z" ) upper++;
else if (str[i] >= "a" && str[i] <= "z" ) lower++;
else if (str[i] >= "0" && str[i] <= "9" ) number++;
else special++;
}
document.write( "Upper case letters: " + upper + "<br>" );
document.write( "Lower case letters : " + lower + "<br>" );
document.write( "Number : " + number + "<br>" );
document.write( "Special characters : " + special + "<br>" );
}
var str = "#GeeKs01fOr@gEEks07" ;
Count(str);
</script>
|
Output
Upper case letters: 5
Lower case letters : 8
Number : 4
Special characters : 2
Time Complexity: O(N), where N is the string length
Auxiliary Space: O(1)
If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!