Simple Array Sum Solution in Java | HackerRank | Simple Array Sum HackerRank Solution


Simple Array Sum Solution in Java | HackerRank | Simple Array Sum HackerRank Solution

Hackerrank Algorithm's Solution


Simple Array Sum Solution in Java

Simple Array Sum HackerRank Solution in Java


Problem:

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

For example, if the array , so return .

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

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: .


https://www.hackerrank.com/challenges/simple-array-sum/problem
Simple Array Sum HackerRank Solution in Java
import java.io.*; import java.math.*; import java.text.*; import java.util.*; import java.util.regex.*; public class Solution { /* * Complete the simpleArraySum function below. */ static int simpleArraySum(int[] ar) { /* * Write your code here. */ int sum=0; for(int i=0;i<ar.length();i++){ sum+=ar[i]; } return sum; } private static final Scanner scanner = new Scanner(System.in); public static void main(String[] args) throws IOException { BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH"))); int arCount = Integer.parseInt(scanner.nextLine().trim()); int[] ar = new int[arCount]; String[] arItems = scanner.nextLine().split(" "); for (int arItr = 0; arItr < arCount; arItr++) { int arItem = Integer.parseInt(arItems[arItr].trim()); ar[arItr] = arItem; } int result = simpleArraySum(ar); bufferedWriter.write(String.valueOf(result)); bufferedWriter.newLine(); bufferedWriter.close(); } }

Post a Comment

0 Comments