In the given string, there is camelCase character

The purpose of this article is to implement a program that prints the number of camelcase characters in a given string.

As you all know, a string is a collection of characters. Now let us see what camel case letters are.

Programming languages like Java use a naming style called camelCase. That is, it does not use spaces or underscores when entering multiple word identifiers, lowercase the first word and capitalize subsequent words. Code written this way is easier to read and understand.

The inner uppercase letters, which resemble camel humps, are what give the name of the font its meaning. WordPerfect, FedEx, and ComputerHope are a few examples of camel case characters.

Among other things, camelCase refers to writing compound words or sentences without using spaces or punctuation marks. Instead, each different word is represented by using lowercase or uppercase letters (e.g., PlayStation).

The total number of uppercase letters in the provided string is the definition of camelCase named characters.

Sample Example 1

Let us take the input string str = “asKKVrvAN"

The output we get is 2.

Explanation

Explanation

The camel case characters appearing in the given string str are K, K, V, A and N.

Example Example 2

Let us take the input string str = “fhgUBHII”

The output we get is 5.

Explanation

Explanation

The camel case characters present in the given string str are U, B, H, I and I.

Sample Example 3

Let us take the input string str = “nbdGONYL”

The output we get is 5.

Explanation

Explanation

The camel case named characters present in the given string str are G, O, N, Y and L.

Sample Example 4

Let us take the input string str = “xyz”

The output we get is 0.

Explanation

Explanation

There are no Camel case characters that are present in the given string str.

Problem Statement

Implement a program to print the number of camel case character present in a given string.

Solution Approach

To print the number of camelcase characters in a given string, we use the following method.

The way to solve this problem and print the number of camelcased named characters in a given string is based on the ASCII value. For beginners who know little about ASCII values, here are the definitions.

Each character variable is assigned a number between 0 and 127 as its ASCII value, which represents the numerical value of the variable.

Uppercase letters A–Z have an ASCII value range of 65–90, while lowercase letters a–z have a value range of 97–122.

In other words, the ASCII code or ASCII value of the capital letter A is 65, B is 66, C is 67, and so on. The letter Z has an ASCII value of 90.

So the stated problem can be solved by iterating over the provided string and counting all characters with ASCII values between [65, 91]. Once the count is complete, we print the output, i.e. print the complete count after making sure all characters are present.

algorithm

The algorithm for printing the number of camelCase characters in a given string is as follows

• Step 1− Start

• Step 2- Define a string

• Step Three- Set Count to Zero

• Step 4- Loop through the string to check for ASCII values

• Step 5− If the ASCII value of the letter

• lies in between the range [65, 90] then we increment the count otherwise ignore.

• Step 6− Get the total number of camel case naming characters and print the output

• Step 7− Stop

Example: C Program

Here you can find a C program implementation of the algorithm written above to print the number of camelcased characters in a given string.

#include  #include  int main(){ char str[]= "abcdEFGH"; // Stores the total number of camel case letters count is set to 0 int count = 0; // Traversing the string for (int i = 0; str[i]; i++) { // Check whether ASCII value of the //letter // lies in between the range [65, 90] // then we increment the count if (str[i] >= 65 && str[i]<=90) count++; } // Print the output as the total count of camel case letters acquired printf("total count of camel case letters acquired: "); printf("%d",count); return 0; }

Output

total count of camel case letters acquired: 4

in conclusion

Similarly, we can print out the number of camelCase characters in any given string. In this article the challenge of getting the number of camelcased characters in a given string is addressed. C programming code is provided here along with the algorithm to print the number of camelcase characters in a given string.

The above is the detailed content of In the given string, there is camelCase character. For more information, please follow other related articles on the PHP Chinese website!