Hello Programmers, In this post, you will know how to solve the HackerRank Simple Array Sum solution. This problem is a part of the HackerRank Algorithms Series.
One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.
HackerRank Simple Array Sum Solution
Task
Given an array of integers, find the sum of its elements.
For example, if the array ar = [1, 2, 3], 1 + 2 + 3 = 6, so return 6.
Function Description
Complete the simpleArraySum function in the editor below. It must return the sum of the array elements as an integer.
simpleArraySum has the following parameter(s):
- ar: an array of integers
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.
Constraints
- 0 < n, arr[i] <= 1000
Output Format
Print the sum of the array’s elements as a single integer.
Sample Input
6
1 2 3 4 10 11
Sample Output
31
Explanation
We print the sum of the array‘s elements: 1+2+3+4+10+11=31
HackerRank Simple Array Sum Solutions
Simple Array Sum Solution in C
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#define N 1000
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int x[N],n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
if(i==0)
{scanf("%d",&x[i]);t=x[i];}
else
if(getchar()==' ')
{scanf("%d",&x[i]);t=t+x[i];}
printf("%d",t);
return 0;Simple Array Sum Solution in Cpp
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
unsigned long long int N, Sum = 0, i, Num;
cin>>N;
for (i = 1 ; i <= N ; i++)
{
cin>> Num;
Sum += Num;
}
cout<<Sum<<endl;
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
return 0;Simple Array Sum Solution in Java
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int length = input.nextInt();
int sum = 0;
for(int i = 0; i < length; i++) {
sum += input.nextInt();
}
System.out.println(sum);
}
Simple Array Sum Solution in Python
n = input() arr = map(int,raw_input().split()) print sum(arr)
Simple Array Sum Solution using JavaScript
function processData(input) {
//Enter your code here
var inputs = input.split('\n');
var arrayToSum = inputs[1].split(' ');
var sum = 0;
for (var i = 0; i < arrayToSum.length; i++) {
sum += parseInt(arrayToSum[i], 10);
}
console.log(sum);
}
process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});
process.stdin.on("end", function () {
processData(_input);
});Simple Array Sum Solution in Scala
bject Solution {
def main(args: Array[String]) {
val lines = io.Source.stdin.getLines
val sum = lines.drop(1).next.split(" ").toList.map( _.toInt ).sum
println(sum)
}Simple Array Sum Solution in Pascal
(* Enter your code here. Read input from STDIN. Print output to STDOUT *)
var n, s, x: longint;
begin
readln(n);
s:= 0;
while n>0 do begin
read(x);
inc(s,x);
dec(n);
end;
writeln(s);
end.Disclaimer: This problem (Simple Array Sum) is generated by HackerRank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.