(arr)
| 17 | |
| 18 | |
| 19 | def equilibrium(arr): |
| 20 | # finding the sum of whole array |
| 21 | total_sum = sum(arr) |
| 22 | leftsum = 0 |
| 23 | for i, num in enumerate(arr): |
| 24 | # total_sum is now right sum |
| 25 | # for index i |
| 26 | total_sum -= num |
| 27 | |
| 28 | if leftsum == total_sum: |
| 29 | return i |
| 30 | leftsum += num |
| 31 | |
| 32 | # If no equilibrium index found, |
| 33 | # then return -1 |
| 34 | return -1 |
| 35 | |
| 36 | |
| 37 | n = int(input()) |
no outgoing calls
no test coverage detected