We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. CamelCase
  5. Discussions

CamelCase

Sort by

recency

|

1882 Discussions

|

  • alban_tyrex
     + 0 comments

    Here is my easy solution in c++, you can have the explanation here : https://youtu.be/1PDDxGbmSj8

    #include <bits/stdc++.h>

using namespace std;


int main()
{
    string s;
    cin >> s;
    int r = 1;
    for(int i = 0; i < s.size(); i++) {
        if(s[i] < 'a') r++;
    }
    cout << r;
    return 0;
}

  • sukhrobtech
     + 0 comments
    def camelcase(s):
    # Write your code here
    count=0
    for char in s: 
        if char.isupper(): 
            count+=1
    return count+1

  • vara2504
     + 0 comments

    Golang:

    func camelcase(s string) int32 {
    // Write your code here
    
    var count  int32
    for _, r := range s{
        if unicode.IsUpper(r){
            count ++
        }        
    }
    return count+1
}

  • benjamin_s1_e
     + 0 comments

    Javascript/Typescript: return (s.match(/[A-Z]/g)?.length ?? 0) + 1

  • janhvirajput1802
     + 0 comments

    def camelcase(s): return sum(1 for i in s if i.isupper()) + 1