Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

https://www.hackerrank.com/challenges/simple-array-sum/problem Given an array of

ID: 3709973 • Letter: H

Question

https://www.hackerrank.com/challenges/simple-array-sum/problem

Given an array of integers, find the sum of its elements. C++ Language

Function Description

Complete the simpleArraySum function described below to return the sum of all elements of the array.

Raw Input Format

The first line contains an integer, , denoting the size of the array.
The second line contains  space-separated integers representing the array's elements.

Sample Input 0

Sample Output 0

Explanation 0

We print the sum of the array's elements: 1+ 2+ 3+ 4+ 10+ 11= 31.

#include

using namespace std;

vector split_string(string);

/*
* Complete the simpleArraySum function below.
*/
int simpleArraySum(vector ar) {
/*
* Write your code here.
*/


}

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

int ar_count;
cin >> ar_count;
cin.ignore(numeric_limits::max(), ' ');

string ar_temp_temp;
getline(cin, ar_temp_temp);

vector ar_temp = split_string(ar_temp_temp);

vector ar(ar_count);

for (int ar_itr = 0; ar_itr < ar_count; ar_itr++) {
int ar_item = stoi(ar_temp[ar_itr]);

ar[ar_itr] = ar_item;
}

int result = simpleArraySum(ar);

fout << result << " ";

fout.close();

return 0;
}

vector split_string(string input_string) {
string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
return x == y and x == ' ';
});

input_string.erase(new_end, input_string.end());

while (input_string[input_string.length() - 1] == ' ') {
input_string.pop_back();
}

vector splits;
char delimiter = ' ';

size_t i = 0;
size_t pos = input_string.find(delimiter);

while (pos != string::npos) {
splits.push_back(input_string.substr(i, pos - i));

i = pos + 1;
pos = input_string.find(delimiter, i);
}

splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));

return splits;
}

simpleArraySum(integer: n, integer array: arr) Parameters: n: array size
ar: array of integers to sum Returns: integer sum of all array elements

Explanation / Answer

#include <iostream>
#include <vector>

using namespace std;

vector split_string(string);

/*
* Complete the simpleArraySum function below.
*/
int simpleArraySum(vector ar) {
   int sum = 0;
   for(int i=0; i<ar.size(); i++)
       sum = sum + ar[i];
   return sum;
}

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

int ar_count;
cin >> ar_count;
cin.ignore(numeric_limits::max(), ' ');

string ar_temp_temp;
getline(cin, ar_temp_temp);

vector ar_temp = split_string(ar_temp_temp);

vector ar(ar_count);

for (int ar_itr = 0; ar_itr < ar_count; ar_itr++) {
int ar_item = stoi(ar_temp[ar_itr]);

ar[ar_itr] = ar_item;
}

int result = simpleArraySum(ar);

fout << result << " ";

fout.close();

return 0;
}

vector split_string(string input_string) {
string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
return x == y and x == ' ';
});

input_string.erase(new_end, input_string.end());

while (input_string[input_string.length() - 1] == ' ') {
input_string.pop_back();
}

vector splits;
char delimiter = ' ';

size_t i = 0;
size_t pos = input_string.find(delimiter);

while (pos != string::npos) {
splits.push_back(input_string.substr(i, pos - i));

i = pos + 1;
pos = input_string.find(delimiter, i);
}

splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));

return splits;
}