Array Sum
Array Sum
Description:
Find out the sum of all the integer numbers in a given Array (Both Positive and Negative) Create a function that finds the sum of all integer numbers in a given array, considering both positive and negative integers. The array may contain a mix of positive and negative integers, as well as zero.
Example 1:
Input: arr = [1, 5, -3, 2, 0, -8, 4]
Output: 1
Explanation: Sum of all integer numbers (1 + 5 – 3 + 2 + 0 – 8 + 4) = 1
Example 2:
Input: arr = [-2, -7, 10, 4, -6, 8]
Output: 7
Explanation: Sum of all integer numbers (-2 – 7 + 10 + 4 – 6 + 8) = 7
Constraints:
The array length |arr| is at least 1 and at most 10^5 Elements in the array are integers ranging from -10^9 to 10^9
Java Code:
public class HackerAlgo { public static int findSumOfIntegers(int[] arr) { int sum = 0; for (int num : arr) { sum += num; } return sum; } public static void main(String[] args) { int[] exampleArr = {1, 5, -3, 2, 0, -8, 4}; int result = findSumOfIntegers(exampleArr); System.out.println(result); }
Python Code:
def find_sum_of_integers(arr): return sum(arr) # Example usage example_arr = [1, 5, -3, 2, 0, -8, 4] result = find_sum_of_integers(example_arr) print(result)
C++ Code:
#include <iostream> #include <vector> class HackerAlgo { public: static int findSumOfIntegers(const std::vector<int>&arr) { int sum = 0; for (int num : arr) { sum += num; } return sum; } }; int main() { // Example usage std::vector<int>exampleArr = {1, 5, -3, 2, 0, -8, 4}; int result = HackerAlgo::findSumOfIntegers(exampleArr); std::cout<< result << std::endl; return 0; }
JavaScript Code:
class HackerAlgo { static findSumOfIntegers(arr) { return arr.reduce((acc, num) =>acc + num, 0); } } // Example usage constexampleArr = [1, 5, -3, 2, 0, -8, 4]; const result = HackerAlgo.findSumOfIntegers(exampleArr); console.log(result);