[Hacker Rank]: Simple Array Sum solved ✓

Author: Gonzalo Diaz

docs/hackerrank/warmup/simpleArraySum.md

@@ -0,0 +1,45 @@
+# [Simple Array Sum](https://www.hackerrank.com/challenges/simple-array-sum/problem)
+
+Difficulty: #easy
+Category: #warmup
+
+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, ar[i] \leq 1000 $
+
+## Output Format
+
+Print the sum of the array's elements as a single integer.
+
+## Sample Input
+
+```text
+6
+1 2 3 4 10 11
+```
+
+## Sample Output
+
+```text
+31
+```
+
+## Explanation
+
+We print the sum of the array's elements: $ 1 + 2 + 3 + 4 + 10 + 11 = 31 $.

src/pkg/hackerrank/warmup/simpleArraySum.go

@@ -0,0 +1,21 @@
+/**
+ * @link Problem definition [[docs/hackerrank/warmup/simpleArraySum.md]]
+ */
+
+package hackerrank
+
+import (
+	utils "gon.cl/algorithm-exercises/src/utils"
+)
+
+func SimpleArraySum(arr []int) int {
+	acum := 0
+
+	for i := 0; i < len(arr); i++ {
+		acum += arr[i]
+	}
+
+	utils.Info("SimpleArraySum answer => %d", acum)
+
+	return acum
+}

src/pkg/hackerrank/warmup/simpleArraySum_test.go

@@ -0,0 +1,21 @@
+package hackerrank
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+func TestSimpleArraySum(t *testing.T) {
+
+	expectedSolution := 31
+	input := []int{1, 2, 3, 4, 10, 11}
+
+	testname := fmt.Sprintf("SimpleArraySum(%v) => %d \n", input, expectedSolution)
+	t.Run(testname, func(t *testing.T) {
+
+		ans := SimpleArraySum(input)
+		assert.Equal(t, expectedSolution, ans)
+	})
+}