Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 10 additions & 11 deletions data_structures/arrays/equilibrium_index_in_array.py
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
Find the Equilibrium Index of an Array.
Reference: https://www.geeksforgeeks.org/equilibrium-index-of-an-array/

Python doctests can be run with the following command:
Python doctest can be run with the following command:
python -m doctest -v equilibrium_index.py

Given a sequence arr[] of size n, this function returns
Expand All @@ -20,35 +20,34 @@
"""


def equilibrium_index(arr: list[int], size: int) -> int:
def equilibrium_index(arr: list[int]) -> int:
"""
Find the equilibrium index of an array.

Args:
arr : The input array of integers.
size : The size of the array.
arr (list[int]): The input array of integers.

Returns:
int: The equilibrium index or -1 if no equilibrium index exists.

Examples:
>>> equilibrium_index([-7, 1, 5, 2, -4, 3, 0], 7)
>>> equilibrium_index([-7, 1, 5, 2, -4, 3, 0])
3
>>> equilibrium_index([1, 2, 3, 4, 5], 5)
>>> equilibrium_index([1, 2, 3, 4, 5])
-1
>>> equilibrium_index([1, 1, 1, 1, 1], 5)
>>> equilibrium_index([1, 1, 1, 1, 1])
2
>>> equilibrium_index([2, 4, 6, 8, 10, 3], 6)
>>> equilibrium_index([2, 4, 6, 8, 10, 3])
-1
"""
total_sum = sum(arr)
left_sum = 0

for i in range(size):
total_sum -= arr[i]
for i, value in enumerate(arr):
total_sum -= value
if left_sum == total_sum:
return i
left_sum += arr[i]
left_sum += value

return -1

Expand Down