2018-09-30 23:01:58 +01:00
---
title: Equilibrium index
id: 5987fd532b954e0f21b5d3f6
challengeType: 5
2019-08-05 09:17:33 -07:00
forumTopicId: 302255
2018-09-30 23:01:58 +01:00
---
## Description
< section id = 'description' >
2019-03-02 17:42:56 +09:00
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 < big > $A$< / big > :
< ul style = "list-style: none;" >
< li > < big > $A_0 = -7$< / big > < / li >
< li > < big > $A_1 = 1$< / big > < / li >
< li > < big > $A_2 = 5$< / big > < / li >
< li > < big > $A_3 = 2$< / big > < / li >
< li > < big > $A_4 = -4$< / big > < / li >
< li > < big > $A_5 = 3$< / big > < / li >
< li > < big > $A_6 = 0$< / big > < / li >
< / ul >
2019-06-14 20:04:16 +09:00
< code > 3< / code > is an equilibrium index, because:
2019-03-02 17:42:56 +09:00
< ul style = "list-style: none;" >
< li > < big > $A_0 + A_1 + A_2 = A_4 + A_5 + A_6$< / big > < / li >
< / ul >
2019-06-14 20:04:16 +09:00
< code > 6< / code > is also an equilibrium index, because:
2019-03-02 17:42:56 +09:00
< ul style = "list-style: none;" >
< li > < big > $A_0 + A_1 + A_2 + A_3 + A_4 + A_5 = 0$< / big > < / li >
< / ul >
(sum of zero elements is zero)
2019-06-14 20:04:16 +09:00
< code > 7< / code > is not an equilibrium index, because it is not a valid index of sequence < big > $A$< / big > .
2018-09-30 23:01:58 +01:00
< / section >
## Instructions
< section id = 'instructions' >
2019-03-02 17:42:56 +09:00
Write a function that, given a sequence, returns its equilibrium indices (if any).
Assume that the sequence may be very long.
2018-09-30 23:01:58 +01:00
< / section >
## Tests
< section id = 'tests' >
```yml
2018-10-04 14:37:37 +01:00
tests:
2019-11-20 07:01:31 -08:00
- text: < code > equilibrium</ code > should be a function.
2019-07-26 05:24:52 -07:00
testString: assert(typeof equilibrium === 'function');
2018-10-20 21:02:47 +03:00
- text: < code > equilibrium([-7, 1, 5, 2, -4, 3, 0])</ code > should return < code > [3,6]</ code > .
2019-07-26 05:24:52 -07:00
testString: assert.deepEqual(equilibrium(equilibriumTests[0]), ans[0]);
2018-10-20 21:02:47 +03:00
- text: < code > equilibrium([2, 4, 6])</ code > should return < code > []</ code > .
2019-07-26 05:24:52 -07:00
testString: assert.deepEqual(equilibrium(equilibriumTests[1]), ans[1]);
2018-10-20 21:02:47 +03:00
- text: < code > equilibrium([2, 9, 2])</ code > should return < code > [1]</ code > .
2019-07-26 05:24:52 -07:00
testString: assert.deepEqual(equilibrium(equilibriumTests[2]), ans[2]);
2018-10-20 21:02:47 +03:00
- text: < code > equilibrium([1, -1, 1, -1, 1, -1, 1])</ code > should return < code > [0,1,2,3,4,5,6]</ code > .
2019-07-26 05:24:52 -07:00
testString: assert.deepEqual(equilibrium(equilibriumTests[3]), ans[3]);
2018-10-20 21:02:47 +03:00
- text: < code > equilibrium([1])</ code > should return < code > [0]</ code > .
2019-07-26 05:24:52 -07:00
testString: assert.deepEqual(equilibrium(equilibriumTests[4]), ans[4]);
2018-10-20 21:02:47 +03:00
- text: < code > equilibrium([])</ code > should return < code > []</ code > .
2019-07-26 05:24:52 -07:00
testString: assert.deepEqual(equilibrium(equilibriumTests[5]), ans[5]);
2018-09-30 23:01:58 +01:00
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
2019-03-02 17:42:56 +09:00
function equilibrium(a) {
2018-09-30 23:01:58 +01:00
// Good luck!
}
```
< / div >
### After Test
< div id = 'js-teardown' >
```js
2018-10-20 21:02:47 +03:00
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], []];
2018-09-30 23:01:58 +01:00
```
< / div >
< / section >
## Solution
< section id = '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;
}
```
< / section >