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

|

1896 Discussions

|

  • calancea_bianca1
     + 0 comments

    def camelcase(s):

        # Write your code here
count = 1
for i in s:
    if i.isupper():
        count+=1
return count

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

  • robertbielicki
     + 0 comments

    RUST:

    fn camelcase(s: &str) ->i32 {
    s.chars().fold(1, |acc, l| if l.is_ascii_uppercase() {acc +1} else {acc})
}

  • patrickgao2020
     + 0 comments

    Heres my simple Python solution!

    def camelcase(s):
    return len([letter for letter in s if letter.isupper()]) + 1

  • harshit_pal2
     + 0 comments

    Here is my Simple and straightforward Java solution :

    return (int) (s.chars().filter(Character::isUpperCase).count()+1);