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

|

1912 Discussions

|

  • lrmeena7878
     + 0 comments

    def camelcase(s): c = 1 for i in range(len(s)): if s[i] == s[i].upper(): c += 1 return c

  • mr7323545
     + 0 comments

    My solution in java 15

    var sarr= s.split("(?=\p{Lu})"); return sarr.length;

  • jonathan_aceves1
     + 0 comments
    def minimumNumber(n, password):
    # Return the minimum number of characters to make the password strong
    minLength = 6
    patterns = [r'[0-9]', r'[a-z]', r'[A-Z]', r'[!@#$%^&\*\(\)\-\+]']
    total_chars = sum([1 for pattern in patterns if not re.search(pattern, password)])
    total_chars += (0 if minLength <= n + total_chars else minLength - n - total_chars)
    return total_chars

  • gopikan299
     + 0 comments

    my python solution

    def camelcase(s):

    tot = 1
for char in s:
    if char.isupper():
        tot += 1
return tot

  • 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;
    }