Active Traders

Description

Submission

#include <bits/stdc++.h>

using namespace std;

string ltrim(const string &);
string rtrim(const string &);


/*
 * Complete the 'mostActive' function below.
 *
 * The function is expected to return a STRING_ARRAY.
 * The function accepts STRING_ARRAY customers as parameter.
 */

vector<string> mostActive(vector<string> customers) {
    map<string, int> m;
    vector<string> res;
    for(auto c : customers) {
        auto iter = m.find(c);
        if(iter == m.end()) m[c] = 1;
        else m[c]++;
    }

    for(auto iter = m.begin(); iter != m.end(); advance(iter, 1)) {
        double percent = (double)iter->second / customers.size();
        if(percent >= 0.05) res.push_back(iter->first);
    }

    sort(res.begin(), res.end());
    return res;
}

int main()
{
    ofstream fout(getenv("OUTPUT_PATH"));

    string customers_count_temp;
    getline(cin, customers_count_temp);

    int customers_count = stoi(ltrim(rtrim(customers_count_temp)));

    vector<string> customers(customers_count);

    for (int i = 0; i < customers_count; i++) {
        string customers_item;
        getline(cin, customers_item);

        customers[i] = customers_item;
    }

    vector<string> result = mostActive(customers);

    for (int i = 0; i < result.size(); i++) {
        fout << result[i];

        if (i != result.size() - 1) {
            fout << "\n";
        }
    }

    fout << "\n";

    fout.close();

    return 0;
}

string ltrim(const string &str) {
    string s(str);

    s.erase(
        s.begin(),
        find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
    );

    return s;
}

string rtrim(const string &str) {
    string s(str);

    s.erase(
        find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
        s.end()
    );

    return s;
}

Balanced System Files Partition

Description

Submission

#include <bits/stdc++.h>

using namespace std;


/*
 * Complete the 'mostBalancedPartition' function below.
 *
 * The function is expected to return an INTEGER.
 * The function accepts following parameters:
 *  1. INTEGER_ARRAY parent
 *  2. INTEGER_ARRAY files_size
 */

struct Node
{
    int size; // the size of the directory excluding the subdirectories
    int total; // the total file size of its children and itself
    int index; // index of tree
    vector<Node*> children;

    Node(int index, int size)
        :
        size(size),
        total(size),
        index(index)
    {}
};

int calculateTotal(Node* root)
{
    if(root->children.empty()) return root->size;
    for(Node* node : root->children) {
        root->total += calculateTotal(node);
    }
    return root->total;
}

void mostBalancedUtil(Node* root, const int total , int& diff)
{
    if(root == NULL) return;
    int d = abs(total - 2 * root->total);
    if(d < diff) diff = d;
    for(Node* child : root->children)
        mostBalancedUtil(child, total, diff);

}

int mostBalancedPartition(vector<int> parent, vector<int> files_size) {
    vector<Node*> nodes(parent.size());
    Node* root = NULL;
    for(int i = 0; i < parent.size(); ++i) {
        Node* node = new Node(i, files_size[i]);
        nodes[i] = node;
        if(parent[i] != -1) {
            nodes[parent[i]]->children.push_back(node);
        } else {
            root = node;
        }
    }
    int total = calculateTotal(root);
    int diff = total;

    mostBalancedUtil(root, total, diff);
    return diff;
}

int main()
{

    int parent_count; cin >> parent_count;
    vector<int> parent(parent_count);

    for (int i = 0; i < parent_count; i++) {
        cin >> parent[i];
    }

    int files_size_count; cin >> files_size_count;

    vector<int> files_size(files_size_count);

    for (int i = 0; i < files_size_count; i++) {

        cin >> files_size[i];
    }

    int result = mostBalancedPartition(parent, files_size);

    cout << result << "\n";

    return 0;
}

Certificate

• https://www.hackerrank.com/certificates/a4d96111023d