CamelCase HackerRank Solution

CamelCase HackerRank Solution
Source : https://www.hackerrank.com/challenges/camelcase

Alice wrote a sequence of words in CamelCase as a string of letters, , having the following properties:

• It is a concatenation of one or more words consisting of English letters.
• All letters in the first word are lowercase.
• For each of the subsequent words, the first letter is uppercase and rest of the letters are lowercase.

Given , print the number of words in on a new line.

For example, . There are words in the string.

Function Description

Complete the camelcase function in the editor below. It must return the integer number of words in the input string.

camelcase has the following parameter(s):

• s: the string to analyze

Input Format

A single line containing string .

Constraints

Output Format

Print the number of words in string .

Sample Input

saveChangesInTheEditor

Sample Output

5

Explanation

String contains five words:

1. save
2. Changes
3. In
4. The
5. Editor

Thus, we print on a new line.

_{Need help? Try this problem first to get familiar with HackerRank environment.}

Source : https://www.hackerrank.com/challenges/camelcase

Solution

	// Karthikalapati.blogspot.com
	import java.util.Scanner;
	public class Solution {
	public static void main(String[] args) {
	Scanner scan = new Scanner(System.in);
	String str = scan.next();
	scan.close();
	System.out.println(numWords(str));
	}
	private static int numWords(String str) {
	int count = 1;
	for (int i = 0; i < str.length(); i++) {
	char ch = str.charAt(i);
	if (ch >= 'A' && ch <= 'Z') {
	count++;
	}
	}
	return count;
	}
	}