[Hacker Rank]: Compare the Triplets solved ✓

Author: Gonzalo Diaz

docs/hackerrank/warmup/aVeryBigSum.md

@@ -0,0 +1,55 @@
+# [A Very Big Sum](https://www.hackerrank.com/challenges/a-very-big-sum)
+
+Difficulty: #easy
+Category: #warmup
+
+In this challenge, you are required to calculate and print the
+sum of the elements in an array, keeping in mind that some of
+those integers may be quite large.
+
+## Function Description
+
+Complete the aVeryBigSum function in the editor below.
+It must return the sum of all array elements.
+
+aVeryBigSum has the following parameter(s):
+
+- int ar[n]: an array of integers.
+
+## Return
+
+- long: the sum of all array elements
+
+## Input Format
+
+The first line of the input consists of an integer n.
+The next line contains  space-separated integers contained in the array.
+
+## Output Format
+
+Return the integer sum of the elements in the array.
+
+## Constraints
+
+$ 1 <= n < 10 $ \
+$ 0 <= ar[i] <= 10^10 $
+
+## Sample Input
+
+```text
+5
+1000000001 1000000002 1000000003 1000000004 1000000005
+```
+
+## Output
+
+```text
+5000000015
+```
+
+## Note
+
+The range of the 32-bit integer is
+($ -2^31 $) to ($ 2^31 - 1 $) or $ [-2147483648, 2147483647] $
+When we add several integer values, the resulting sum might exceed the
+above range. You might need to use long int C/C++/Java to store such sums.

src/pkg/hackerrank/warmup/aVeryBigSum.go

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

src/pkg/hackerrank/warmup/aVeryBigSum_test.go

@@ -0,0 +1,21 @@
+package hackerrank
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+func TestAVeryBigSum(t *testing.T) {
+
+	var input = []int{1000000001, 1000000002, 1000000003, 1000000004, 1000000005}
+	const expectedSolution = 5000000015
+
+	testname := fmt.Sprintf("solveMeFirst(%d) => %d \n", input, expectedSolution)
+	t.Run(testname, func(t *testing.T) {
+
+		ans := AVeryBigSum(input)
+		assert.Equal(t, expectedSolution, ans)
+	})
+}