HackerRank CamelCase problem solution

In this HackerRank CamelCase problem, you have Give s, determine the number of words in s.

Problem solution in Python programming.

#!/bin/python3

import sys


s = input().strip()

count = 1
for letter in s:
    if ord(letter) <= ord('Z'):
        count += 1
print(count)

Problem solution in Java Programming.

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.next();
        String p = s.toUpperCase();
        int l = s.length();
        int ans = 1;
        for (int i = 0; i < l; i++) {
            if (p.charAt(i) == s.charAt(i)) ans++;
        }
        
        System.out.println(ans);
    }
}

Problem solution in C++ programming.

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    string s;
    cin >> s;
    int ans=1;
    for(int i=0; i<s.size(); i++) {
        if(s[i]>='A' && s[i]<='Z') ans++;
        
    }
    printf("%d\n",ans);
    return 0;
}

Problem solution in C programming.

#include <stdio.h>
#include <string.h>

int main(void) {
	// your code goes here
	char inp[100005];
    int i,c=0,l;
	scanf("%s",inp);
	l=strlen(inp);
	for(i=0;i<l;i++)
	{
	    if(inp[i]>='A' && inp[i]<='Z')
	    c++;
	}
	printf("%d\n",c+1);
	return 0;
}

Problem solution in JavaScript programming.

process.stdin.resume();
process.stdin.setEncoding('ascii');

var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;

process.stdin.on('data', function (data) {
    input_stdin += data;
});

process.stdin.on('end', function () {
    input_stdin_array = input_stdin.split("\n");
    main();    
});

function readLine() {
    return input_stdin_array[input_currentline++];
}

/////////////// ignore above this line ////////////////////

function main() {
    var s = readLine();
    var num = 0 ; 
    for(var i = 0; i< s.length ; i++){
        if(s.charCodeAt(i)>=65 && s.charCodeAt(i)<= 90)
            num++; 
    }
    num++; 
    console.log(num);
}