# CodeSignal Arcade – alternatingSums

## Problem

Several people are standing in a row and need to be divided into two teams. The first person goes into *team 1*, the second goes into *team 2*, the third goes into *team 1* again, the fourth into *team 2*, and so on.

You are given an array of positive integers – the weights of the people. Return an array of two integers, where the first element is the total weight of *team 1*, and the second element is the total weight of *team 2* after the division is complete.

Example

For `a = [50, 60, 60, 45, 70]`

, the output should be`solution(a) = [180, 105]`

.

## Solution

### Idea

This problem is too easy. Just loop through the array and use modulo operator `%`

to get the remainer of the index with 2 and sum the weight.

### Code

```
function solution(a) {
let weight1 = 0;
let weight2 = 0;
for (let i = 0; i < a.length; i++) {
i % 2 == 0 ? weight1 += a[i] : weight2 += a[i];
}
return [weight1, weight2];
}
```