CamelCase - HackerRank || HackerRank CamelCase Solution

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

int main()
{
    char sentense[100000];
    int count = 1;
    scanf("%s", sentense);
    int n = strlen(sentense);
    for (int i = 0; i <= n; i++)
    {
        if (sentense[i] >= 65 && sentense[i] <= 90)
        {
            count++;
        }
    }
    printf("%d\n", count);

    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    string sentense;
    int count = 1;
    cin >> sentense;
    int length = sentense.length();
    for (int i = 0; i < length; i++)
    {
        if (sentense[i] >= 65 && sentense[i] <= 90)
        {
            count++;
        }
    }
    cout << count << endl;

    return 0;
}

import java.util.Scanner;

public class CamelCase {
    public static void main(String[] args) {
        int count = 0;
        Scanner input = new Scanner(System.in);
        String sentence = input.nextLine();
        char[] charArray = sentence.toCharArray();
        for (char c : charArray) {
            if (Character.isUpperCase(c)) {
                count++;
            }
        }
        System.out.println(count + 1);
    }
}