--- title: Equilibrium index id: 5987fd532b954e0f21b5d3f6 challengeType: 5 --- ## Description
An equilibrium index of a sequence is an index into the sequence such that the sum of elements at lower indices is equal to the sum of elements at higher indices. For example, in a sequence $A$: 3 is an equilibrium index, because: 6 is also an equilibrium index, because: (sum of zero elements is zero) 7 is not an equilibrium index, because it is not a valid index of sequence $A$.
## Instructions
Write a function that, given a sequence, returns its equilibrium indices (if any). Assume that the sequence may be very long.
## Tests
```yml tests: - text: equilibrium is a function. testString: assert(typeof equilibrium === 'function', 'equilibrium is a function.'); - text: equilibrium([-7, 1, 5, 2, -4, 3, 0]) should return [3,6]. testString: assert.deepEqual(equilibrium(equilibriumTests[0]), ans[0], 'equilibrium([-7, 1, 5, 2, -4, 3, 0]) should return [3,6].'); - text: equilibrium([2, 4, 6]) should return []. testString: assert.deepEqual(equilibrium(equilibriumTests[1]), ans[1], 'equilibrium([2, 4, 6]) should return [].'); - text: equilibrium([2, 9, 2]) should return [1]. testString: assert.deepEqual(equilibrium(equilibriumTests[2]), ans[2], 'equilibrium([2, 9, 2]) should return [1].'); - text: equilibrium([1, -1, 1, -1, 1, -1, 1]) should return [0,1,2,3,4,5,6]. testString: assert.deepEqual(equilibrium(equilibriumTests[3]), ans[3], 'equilibrium([1, -1, 1, -1, 1, -1, 1]) should return [0,1,2,3,4,5,6].'); - text: equilibrium([1]) should return [0]. testString: assert.deepEqual(equilibrium(equilibriumTests[4]), ans[4], 'equilibrium([1]) should return [0].'); - text: equilibrium([]) should return []. testString: assert.deepEqual(equilibrium(equilibriumTests[5]), ans[5], 'equilibrium([]) should return [].'); ```
## Challenge Seed
```js function equilibrium(a) { // Good luck! } ```
### After Test
```js const equilibriumTests = [[-7, 1, 5, 2, -4, 3, 0], // 3, 6 [2, 4, 6], // empty [2, 9, 2], // 1 [1, -1, 1, -1, 1, -1, 1], // 0,1,2,3,4,5,6 [1], // 0 [] // empty ]; const ans = [[3, 6], [], [1], [0, 1, 2, 3, 4, 5, 6], [0], []]; ```
## Solution
```js function equilibrium(a) { let N = a.length, i, l = [], r = [], e = []; for (l[0] = a[0], r[N - 1] = a[N - 1], i = 1; i < N; i++) { l[i] = l[i - 1] + a[i], r[N - i - 1] = r[N - i] + a[N - i - 1]; } for (i = 0; i < N; i++) { if (l[i] === r[i]) e.push(i); } return e; } ```