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

|

1908 Discussions

|

  • mdsanz
     + 0 comments

    My Java 8 Solution

    public static int camelcase(String s) {
        int count = 1;
        
        for (char c : s.toCharArray()) {
            if (Character.isUpperCase(c)) {
                count++;
            }
        }
        
        return count;
    }

  • yashdeliwala10
     + 0 comments

    my cpp solution for this programme

    int camelcase(string s) {

    int count=1;  //  count=1 for min 1 word
for(int i = 0;i <s.size();i++){ // loop lessthan size
    if(s[i] < 'a')   //if less than lowescase than count++
    count++;
}

return count;

    }

  • afzal_saiyed931
     + 0 comments

    def camelcase(s): # Write your code here wordCount = 1 for i in s: if "A" <= i <= "Z": wordCount += 1

    return wordCount

  • geovanni_luna
     + 0 comments

    Here is a python O(n) time and O(1) space:

    def camelcase(s):
    if s == "":
        return 0
        
    w_count = 1;
    
    for ch in s:
        if ch.isupper():
            w_count += 1
            
    return w_count

  • giorgibregvadze1
     + 0 comments

    Javascript

    function camelcase(s) {
    return [...s.matchAll(/[A-Z]/g)].length + 1
}