Hackerrank - Big Sorting, Super Reduced String, Intro to Tutorial Challenges, CamelCase

---

[풀이 - Big Sorting] : <Easy / 62.62%>

bool strcomp(string s1, string s2)
{
    int l1 = s1.size();
    int l2 = s2.size();
    //
    if(l1 != l2)
        return l1 < l2;
    else
    {
        for(int i = 0; i < min(l1, l2); ++i)
        {
            bool value = (s1[i] == s2[i]);
            //
            if(value)
                continue;
            else
                return (s1[i] < s2[i]);
        }
    }
    //
    return false;
}

vector<string> bigSorting(vector<string> unsorted)
{
    vector<string> result = unsorted;
    
    sort(result.begin(), result.end(), strcomp);
    
    return result;
}

 

---

[풀이 - Super Reduced String] : <Easy / 86.51%>

string superReducedString(string s)
{
    string r = s;
    //
    int i = 0;
    while(i < r.size() - 1)
    {
        if(r[i] == r[i + 1])
        {
            r.erase(i, 2);
            if(i > 0)
                --i;
        }
        else
            ++i;
        //
        if(r == "")
            return "Empty String";
    }
    //
    return r;
}

 

---

[풀이 - Intro to Tutorial Challenges] : <Easy / 98.30%>

int introTutorial(int V, vector<int> arr)
{
    for(int i = 0; i < arr.size(); ++i)
    {
        if(arr[i] == V)
            return i;
    }
    //
    return 0;
}

 

---

[풀이 - CamelCase] : <Easy / 98.14%>

int camelcase(string s)
{
    int result = 1;
    //
    for(int i = 0; i < s.size(); ++i)
    {
        if('A' <= s[i] && s[i] <= 'Z')
            ++result;
    }
    //
    return result;
}