Check if lowercase and uppercase characters are in same order
Given a string str containing only lower and uppercase alphabets. The task is to check if both lowercase characters and uppercase characters follow the same order respectively.
Note: If a character occurs more than once in lowercase then the occurrence of the same character in the uppercase should be same.
Examples:
Input: str = "geeGkEEsKS" Output: Yes Lowercase = geeks, Uppercase = GEEKS Input: str = "GeEkKg" Output: No Lowercase = ekg, Uppercase = GEK
Approach:
- Traverse the string.
- Store the lowercase alphabets and uppercase alphabets in two separate strings lowerStr and upperStr respectively.
- Convert lowercase string to uppercase.
- Check if both uppercase strings are equal or not.
- Print Yes if equal, else print No.
Below is the implementation of above approach:
C++
// C++ program to check if lowercase and // uppercase characters are in same order #include <bits/stdc++.h> using namespace std; // Function to check if both the // case follow the same order bool isCheck(string str) { int len = str.length(); string lowerStr = "", upperStr = ""; // Traverse the string for (int i = 0; i < len; i++) { // Store both lowercase and uppercase // in two different strings if (str[i] >= 65 && str[i] <= 91) upperStr = upperStr + str[i]; else lowerStr = lowerStr + str[i]; } // using transform() function and ::toupper in STL transform(lowerStr.begin(), lowerStr.end(), lowerStr.begin(), ::toupper); return lowerStr == upperStr; } // Driver code int main() { string str = "geeGkEEsKS"; isCheck(str) ? cout << "Yes" : cout << "No"; return 0; } |
chevron_right
filter_none
Java
//Java program to check if lowercase and // uppercase characters are in same order public class GFG { //Function to check if both the //case follow the same order static boolean isCheck(String str) { int len = str.length(); String lowerStr = "", upperStr = ""; char[] str1 = str.toCharArray(); // Traverse the string for (int i = 0; i < len; i++) { // Store both lowercase and uppercase // in two different strings if ((int)(str1[i]) >= 65 && (int)str1[i] <= 91) upperStr = upperStr + str1[i]; else lowerStr = lowerStr + str1[i]; } // transform lowerStr1 to upper String transformStr = lowerStr.toUpperCase(); return(transformStr.equals(upperStr)); } //Driver code public static void main(String[] args) { String str = "geeGkEEsKS"; if (isCheck(str)) System.out.println("Yes"); else System.out.println("No"); } } |
chevron_right
filter_none
Python 3
# Python 3 program to Check if lowercase and # uppercase characters are in same order # Function to check if both the # case follow the same order def isCheck(str) : length = len(str) lowerStr, upperStr = "", "" # Traverse the string for i in range(length) : # Store both lowercase and # uppercase in two different # strings if (ord(str[i]) >= 65 and ord(str[i]) <= 91) : upperStr = upperStr + str[i] else : lowerStr = lowerStr + str[i] # transfor lowerStr to uppercase transformStr = lowerStr.upper() return transformStr == upperStr # Driver Code if __name__ == "__main__" : str = "geeGkEEsKS" if isCheck(str) : print("Yes") else : print("No") # This code is contributed # by ANKITRAI1 |
chevron_right
filter_none
C#
// C# program to check if lowercase and // uppercase characters are in same order using System; class GFG { //Function to check if both the //case follow the same order static bool isCheck(string str) { int len = str.Length; string lowerStr = "", upperStr = ""; char[] str1 = str.ToCharArray(); // Traverse the string for (int i = 0; i < len; i++) { // Store both lowercase and uppercase // in two different strings if ((int)(str1[i]) >= 65 && (int)str1[i] <= 91) upperStr = upperStr + str1[i]; else lowerStr = lowerStr + str1[i]; } // transform lowerStr1 to upper String transformStr = lowerStr.ToUpper(); return(transformStr.Equals(upperStr)); } //Driver code public static void Main(String[] args) { String str = "geeGkEEsKS"; if (isCheck(str)) Console.WriteLine("Yes"); else Console.WriteLine("No"); } } |
chevron_right
filter_none
Output:
Yes
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
Recommended Posts:
- Convert all lowercase characters to uppercase whose ASCII value is co-prime with k
- Maximum distinct lowercase alphabets between two uppercase
- Program to display all alphabets from A to Z in uppercase and lowercase both
- Count Uppercase, Lowercase, special character and numeric values
- Minimum number of operations to move all uppercase characters before all lower case characters
- Check whether two strings contain same characters in same order
- Check if the characters of a given string are in alphabetical order
- Check if string follows order of characters defined by a pattern or not | Set 3
- Check if string follows order of characters defined by a pattern or not | Set 1
- Check if string follows order of characters defined by a pattern or not | Set 2
- Print characters having odd frequencies in order of occurrence
- Print characters and their frequencies in order of occurrence
- Print characters having even frequencies in order of occurrence
- Print characters in decreasing order of frequency
- Print all distinct characters of a string in order (3 Methods)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
